This is a demo version of a very fast exact maximum clique algorithm (possibly the fastest at present) written by Pablo San Segundo and described in:

An exact bit-parallel algorithm for the maximum clique problem. Pablo San Segundo, Diego Rodriguez-Losada, Agustin Jimenez. Computers & Operations Research (COR), Elsevier, ISSN: 0305-0548, Vol. 38, No. 2., pp. 571-581. (2011)

An improved bit parallel exact maximum clique algorithm	. Pablo San Segundo, Fernando Matia, Diego Rodriguez-Losada, Miguel Hernando, Optimization Letters (OPTL), Springer, (2011) 

amongst other publications.

INSTRUCTIONS

The binary requires as input a graph written in dimacs format. In this demo version only graphs up to 300 vertices are supported.
The input graph is ordered by minimum degree (placed in reverse order) prior to solving, so partial and full solutions are supplied in the new order and not int the original one.

Example of command line execution:

	clique.exe brock200_1.clq

given that the file is in the same directory as the binary (else give the full path).




IMPORTANT: The binary runs only on windows 64 bit platforms (64bit machines + 64bit OS).


5th of May 2012
Pablo San Segundo