Enumerating all connected maximal common subgraphs in two graphs

Theoretical Computer Science

Volumn 250, Issue 1-2, 2001, Pages 1-30

  Koch, Ina ^a  

^a MAX DELBRÜCK CENTER FOR MOLECULAR MEDICINE   (Germany)

Author keywords

Bron Kerbosch algorithm; Cliques; Connected maximal common subgraphs; Graph theory

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

BRON-KERBOSCH ALGORITHMS; CONNECTED MAXIMAL COMMON SUBGRAPS;

COMPUTATIONAL GEOMETRY;

EID: 0034909407     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0304-3975(00)00286-3     Document Type: Article

References (24)

1. E.A. Akkoyunlu, The enumeration of maximal cliques of large graphs, SIAM J. Comput. 2 (1973) 1-6.
2. L. Babel, G. Tinhofer, A branch and bound algorithm for the maximum clique problem, Methods Models Oper. Res. 34 (1990) 207-217.
3. E. Balas, H. Samuelsson, A node covering algorithm, Naval Res. Log. Quart. 24 (1977) 213-233.
4. E. Balas, C.S. Yu, Finding a maximum clique in an arbitrary graph, SIAM J. Comput. 15 (1986) 1054-1068.
5. A.T. Brint, P. Willett, Algorithms for the identification of three-dimensional maximal common substructures, J. Chem. Inform. Comput. Sci. 2 (1987) 311-320.
6. C. Bron, J. Kerbosch, Algorithm 457 - finding all cliques of an undirected graph, Comm. ACM 16 (1973) 575-577.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory on NP-Completeness, W.H. Freeman and Company, San Francisco, CA, 1979.
8. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of chordal graphs, SIAM J. Comput. 1 (1972) 180-187.
9. L. Gerhards, W. Lindenberg, Clique detection for nondirected graphs: two new algorithms, Computing 21 (1979) 295-322.
10. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. H.M. Grindley, P.J. Artymiuk, D.W. Rice, P. Willett, Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm, J. Mol. Biol. 229 (1993) 707-721.
12. F. Harary, Graph Theory, R. Oldenburg Verlag, München - Wien, 1974.
13. 1-ε, in: Proceedings of the 38th Ann. Symp. Found. Comp. Science - FOCS'96, IEEE, Burlington, Vermont, Washington, Brussels, Tokyo, 1996, pp. 627-633.
14. W.-L. Hsu, Y. Ikura, G.L. Nemhauser, A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles, Math. Programming 20 (1981) 225-232.
15. H.J. Johnston, Cliques of a graph - variations on the Bron-Kerbosch algorithm, Int. J. Comput. Inform. Sci. 5 (1976) 209-238.
16. I. Koch, T. Lengauer, Detection of distant structural similarities in a set of proteins using a fast graph-based method, in: T. Gaasterland, P. Karp, K. Karplus, C. Ouzounis, C. Sander, A. Valencia (Eds.), Proc. 5th Int. Conf. on Intelligent Systems for Molecular Biology, AAAI Press, Menlo Park, CA, 1997, pp. 167-178.
17. I. Koch, T. Lengauer, E. Wanke, An algorithm for finding maximal common subtopologies in a set of protein structures, J. Comput. Biol. 3 (1996) 289-306.
18. G. Levi, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo 9 (1972) 341-352.
19. T. Madej, J.-F. Gibrat, S.H. Bryant, Threading a database of protein cores, PROTEINS:, Struct. Function Genetics 23 (1995) 356-369.
20. K. Mizguchi, N. Gō, Comparison of spatial arrangements of secondary structural elements in proteins, Protein Eng. 8 (1995) 353-362.
21. J.W. Moon, L. Moser, On Cliques in graphs, Israel. J. Math. 3 (1965) 23-28.
22. V. Nicholson, C.-C. Tsai, M. Johnson, M. Naim, A subgraph isomorphism theorem for molecular graphs, in: R.B. King, D.H. Rouvray (Eds.), Graph Theory and Topology in Chemistry, Elsevier Science Publishers B.V., Amsterdam, 1987, pp. 226-230.
23. R.E. Tarjan, A.E. Trojanowski, Finding a maximum independent set, SIAM J. Comput. 6 (1977) 537-546.
24. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932) 150-168.