Cliq: A Clique Finding Algorithm

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