Parallel algorithms for finding cliques in a graph

A clique is a subgraph in a graph that is complete in the sense that each two of its nodes are connected by an edge. Finding cliques in a given graph is an important procedure in discrete mathematical modeling. The paper will show how concepts such as splitting partitions, quasi coloring, node and edge dominance are related to clique search problems. In particular we will discuss the connection with parallel clique search algorithms. These concepts also suggest practical guide lines to inspect a given graph before starting a large scale search.

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

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

[3]  P. Kaski,et al.  Classification Algorithms for Codes and Designs , 2005 .

[4]  Yun Zhang,et al.  Elissa J. Chesler, Michael A. Langston: On Finding Bicliques in Bipartite Graphs: a Novel Algorithm with Application to the Integration of Diverse Biological Data Types , 2008, HICSS.

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

[6]  Panos M. Pardalos,et al.  Test case generators and computational results for the maximum clique problem , 1993, J. Glob. Optim..

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

[8]  Luitpold Babel.  Finding maximum cliques in arbitrary and in special graphs , 2005, Computing.

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

[10]  Egon Balas,et al.  Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring , 1996, Algorithmica.

[11]  M. Trick,et al.  Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .

[12]  Wilbert E. Wilhelm,et al.  Clique-detection models in computational biochemistry and genomics , 2006, Eur. J. Oper. Res..

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

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