A note on the problem of reporting maximal cliques

Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper of Bron-Kerbosh [C. Bron, J. Kerbosch, Algorithm 457: Finding all cliques of an undirected graph, Communication of ACM 16 (9) (1973) 575-577], and two papers recently published in TCS, namely that of Tomita et al. [Tomita, A. Tanaka, H. Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science 363 (1) (2006) 28-42], and that of Koch [I. Koch, Fundamental study: Enumerating all connected maximal common subgraphs in two graphs, Theoretical Computer Science 250 (1-2) (2001) 1-30]. In particular, we show that the strategy of Tomita et al. is a simple modification of the Bron-Kerbosch algorithm, based on an (un-exploited) observation raised in Koch's paper.

[1]  Chinmay Karande,et al.  Reporting maximal cliques: new insights into an old problem , 2005 .

[2]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[3]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[4]  Thomas Lengauer,et al.  An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures , 1996, J. Comput. Biol..

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

[6]  Frédéric Cazals,et al.  An algorithm for reporting maximal c-cliques , 2005, Theor. Comput. Sci..

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

[8]  Ina Koch,et al.  Enumerating all connected maximal common subgraphs in two graphs , 2001, Theor. Comput. Sci..

[9]  D. Baum.  Finding All Maximal Cliques of a Family of Induced Subgraphs , 2003 .

[10]  Peter Willett,et al.  Graph-Theoretic Techniques for Macromolecular Docking , 2000, J. Chem. Inf. Comput. Sci..

[11]  P Willett,et al.  Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. , 1993, Journal of molecular biology.

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

[13]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

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

[15]  Brian K. Shoichet,et al.  Molecular docking using shape descriptors , 1992 .

[16]  R Samudrala,et al.  A graph-theoretic algorithm for comparative modeling of protein structure. , 1998, Journal of molecular biology.

[17]  J. Moon,et al.  On cliques in graphs , 1965 .