Exact Algorithms for Maximum Clique: A Computational Study

We investigate a number of recently reported exact algorithms for the maximum clique problem. The program code is presented and analyzed to show how small changes in implementation can have a drastic effect on performance. The computational study demonstrates how problem features and hardware platforms influence algorithm behaviour. The effect of vertex ordering is investigated. One of the algorithms (MCS) is broken into its constituent parts and we discover that one of these parts frequently degrades performance. It is shown that the standard procedure used for rescaling published results (i.e., adjusting run times based on the calibration of a standard program over a set of benchmarks) is unsafe and can lead to incorrect conclusions being drawn from empirical data.

[1]  Chu Min Li,et al.  Combining Graph Structure Exploitation and Propositional Reasoning for the Maximum Clique Problem , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[2]  Etsuji Tomita,et al.  An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments , 2001, J. Glob. Optim..

[3]  Chu Min Li,et al.  An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem , 2010, AAAI 2010.

[4]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[5]  Jon Louis Bentley,et al.  Engineering a sort function , 1993, Softw. Pract. Exp..

[6]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[7]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[8]  Torsten Fahle,et al.  Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique , 2002, ESA.

[9]  B A Huberman,et al.  Cooperative Solution of Constraint Satisfaction Problems , 1991, Science.

[10]  Patric R. J. Östergård,et al.  A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[12]  Katharina Anna Zweig,et al.  What makes a phase transition? Analysis of the random satisfiability problem , 2010, ArXiv.

[13]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[14]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[15]  Pablo San Segundo,et al.  A New Implicit Branching Strategy for Exact Maximum Clique , 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

[16]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[17]  David Eppstein,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2011, JEAL.

[18]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[19]  Myriam Preissmann,et al.  Sequential Colorings and Perfect Graphs , 1999, Discret. Appl. Math..

[20]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[21]  Alexandre Prusch Züge,et al.  Branch and bound algorithms for the maximum clique problem under a unified framework , 2011, Journal of the Brazilian Computer Society.

[22]  P. Gács,et al.  Algorithms , 1992 .

[23]  Pablo San Segundo,et al.  An exact bit-parallel algorithm for the maximum clique problem , 2011, Comput. Oper. Res..

[24]  Etsuji Tomita,et al.  An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique , 2003, DMTCS.

[25]  Laurent Perron.  Search Procedures and Parallelism in Constraint Programming , 1999, CP.

[26]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[27]  David R. Wood,et al.  An algorithm for finding a maximum clique in a graph , 1997, Oper. Res. Lett..

[28]  Shinya Takahashi,et al.  A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique , 2010, WALCOM.

[29]  StrashDarren,et al.  Listing All Maximal Cliques in Large Sparse Real-World Graphs , 2013 .

[30]  Edward C. Sewell,et al.  A Branch and Bound Algorithm for the Stability Number of a Sparse Graph , 1998, INFORMS J. Comput..

[31]  E. A. Akkoyunlu,et al.  The Enumeration of Maximal Cliques of Large Graphs , 1973, SIAM J. Comput..

[32]  Pablo San Segundo,et al.  An improved bit parallel exact maximum clique algorithm , 2013, Optim. Lett..

[33]  Mark D. Hill,et al.  Amdahl's Law in the Multicore Era , 2008, Computer.

[34]  L BeckLeland,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983 .

[35]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[36]  Gottfried Tinhofer,et al.  A branch and bound algorithm for the maximum clique problem , 1990, ZOR Methods Model. Oper. Res..

[37]  Jean-Charles Régin,et al.  Using Constraint Programming to Solve the Maximum Clique Problem , 2003, CP.

[38]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[39]  Mark D. Hill,et al.  Amdahl's Law in the Multicore Era , 2008 .

[40]  Janez Konc,et al.  An improved branch and bound algorithm for the maximum clique problem , 2007 .