Cliq: A Clique Finding Algorithm

Authors

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

Keywords:

Clique problem, graphs, recursion and back-tracking.

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

Downloads

Published

2012-06-19

How to Cite

Z.U.A.KHUHRO, F. N. MEMON, M.U. R. MAREE, & A.P. HARRISON. (2012). Cliq: A Clique Finding Algorithm. Sindh University Research Journal - SURJ (Science Series), 44(2). Retrieved from https://sujo.usindh.edu.pk/index.php/SURJ/article/view/5729

Issue

Vol. 44 No. 2 (2012): Sindh University Research Journal (Science Series) SURJ

Section

Articles