Commit 9ab9717c authored by Janez Konc's avatar Janez Konc

Update README.md

parent e69d5119
MCQD MCQD
==== ====
MaxCliqueDyn is a fast exact algorithm for finding a maximum clique in an undirected graph. MaxCliqueDyn is a fast exact algorithm for finding a maximum clique in an undirected graph.
More information about this project at [MaxCliqueDyn Website](http://insilab.org/maxclique)
Install
======= Install
Compile with: g++ -O3 mcqd.cpp -o mcqd =======
Compile with: g++ -O3 mcqd.cpp -o mcqd
How to Run
========== How to Run
==========
Run with: mcqd test.clq Run with: mcqd test.clq
Notes Notes
===== =====
mcqd.cpp ... example program that shows how to use class implemented in mcqd.h 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 mcqd.h ... a class that contains two variants of the MCQD maximum clique algorithm
test.clq ... an example clique in DIMACS format test.clq ... an example clique in DIMACS format
Citation 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. 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.
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment