A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided.

[1]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[2]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[3]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .

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

[5]  Ronan Bureau,et al.  The Maximum Common Substructure as a Molecular Depiction in a Supervised Classification Context: Experiments in Quantitative Structure/Biodegradability Relationships , 2002, J. Chem. Inf. Comput. Sci..

[6]  Carlo Sansone,et al.  A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs , 2003, GbRPR.

[7]  Peter Willett,et al.  Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm , 2002, J. Chem. Inf. Comput. Sci..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Peter Willett,et al.  RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs , 2002, Comput. J..

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

[11]  Irene Luque Ruiz,et al.  Step-by-Step Calculation of All Maximum Common Substructures through a Constraint Satisfaction Based Algorithm , 2004, J. Chem. Inf. Model..

[12]  Mario Vento,et al.  A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking , 2001 .

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

[14]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[15]  Mario Vento,et al.  A large database of graphs and its use for benchmarking graph isomorphism algorithms , 2003, Pattern Recognit. Lett..