CLIQ: A CLIQUE FINDING ALGORITHM

Z.U.A. KHUHRO, F. N. MEMON, M.U. R. MAREE, A.P. HARRISON

Abstract


The  maximum  clique  problem is very important in bioinformatics, computer science and other fields. An algorithm has been designed for finding a maximum clique in a graph of any size. The algorithm is based on recursion and back-tracking techniques. This paper describes the algorithm, an example and some results. The algorithm is tested on DIMACS graphs and its performance has also been compared with an existing algorithm, the Cliquer.


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Sindh University Research Journal - SURJ (Science Series)

 Copyright © University of Sindh, Jamshoro. 2017 All Rights Reserved.
Printing and Publication by: Sindh University Press.