M

mcqd

A fast exact algorithm for finding a maximum clique in an undirected graph

MCQD

MaxCliqueDyn is a fast exact algorithm for finding a maximum clique in an undirected graph. More information about this project at MaxCliqueDyn Website

Install

Compile with: g++ -O3 mcqd.cpp -o mcqd

How to Run

Run with: mcqd test.clq

Notes

mcqd.cpp ... example program that shows how to use class implemented in mcqd.h mcqd.h ... a class that contains two variants of the MCQD maximum clique algorithm test.clq ... an example clique in DIMACS format

Citation

Konc,J. and Janezic,D. An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem., 2007, 58, 569-590.