No Detail Found!

Cliq: A clique finding algorithm.

Author(s)
Z. U. A. Khuhro Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
F. N. Memon Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
M. U. R. Maree Institute of Mathematics and Computer Science, University of Sindh, Jamshoro, Pakistan
A. P. Harrison Department of Mathematical Sciences and Biological Sciences, University of Essex, UK
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.
Publication Details
Page(s) 313-318
DOI DOI not available
Published Journal: Sindh University Research Journal, Volume: 44, Issue: 2, Year: 2012

Request the full text from PASTIC

More from Sindh University Research Journal
0

Citations

0

Downloads

26

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk