Enumerating all connected maximal common subgraphs in two graphs

We represent a new method for finding all connected maximal common subgraphs in two graphs which is based on the transformation of the problem into the clique problem. We have developed new algorithms for enumerating all cliques that represent connected maximal common subgraphs. These algorithms are based on variants of the Bron–Kerbosch algorithm. In this paper we explain the transformation of the maximal common subgraph problem into the clique problem. We give a short summary of the variants of the Bron–Kerbosch algorithm in order to explain the modification of that algorithm such that the detected cliques represent connected maximal common subgraphs. After introducing and proving several variants of the modified algorithm we discuss the runtimes for all variants by means of random graphs. The results show the drastical reduction of the runtimes for the new algorithms.

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

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

[3]  Coenraad Bron,et al.  Finding all cliques of an undirected graph , 1973 .

[4]  George L. Nemhauser,et al.  A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles , 1981, Math. Program..

[5]  G. Levi.  A note on the derivation of maximal common subgraphs of two directed or undirected graphs , 1973 .

[6]  Dennis H. Rouvray,et al.  Graph Theory and Topology in Chemistry , 1987 .

[7]  Frank Harary,et al.  Graph Theory , 2016 .

[8]  Peter Willett,et al.  Algorithms for the identification of three-dimensional maximal common substructures , 1987, J. Chem. Inf. Comput. Sci..

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

[10]  K. Mizuguchi,et al.  Comparison of spatial arrangements of secondary structural elements in proteins. , 1995, Protein engineering.

[11]  Egon Balas,et al.  A node covering algorithm , 1977 .

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

[13]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[14]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

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

[16]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[17]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

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

[19]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[20]  Thomas Lengauer,et al.  Detection of Distant Structural Similarities in a Set of Proteins Using a Fast Graph-Based Method , 1997, ISMB.

[21]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[22]  S. Bryant,et al.  Threading a database of protein cores , 1995, Proteins.