An Exact Parallel Algorithm for the Maximum Clique Problem

In this paper we present a portable exact parallel algorith m for the maximum clique problem on general graphs. Computational results wi h random graphs and some test graphs from applications are presented. The algorithm is parallelized using the Message Passing Interface (MPI) standard. The algorithm is bas ed on the Carraghan-Pardalos exact algorithm (for… CONTINUE READING