A comparison of algorithms for maximum common subgraph on randomly connected graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2396, Issue , 2002, Pages 123-132

  Bunke, Horst ^a   Foggia, Pasquale ^b   Guidobaldi, Corrado ^a,b   Sansone, Carlo ^b   Vento, Mario ^c  

^a UNIVERSITY OF BERN   (Switzerland)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^c UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION; SYNTACTICS;

COMMON SUBGRAPH; CONNECTED GRAPH; EXACT ALGORITHMS; GRAPH G; INEXACT ALGORITHM; MAXIMUM COMMON SUBGRAPH; TWO-GRAPHS;

GRAPH THEORY;

EID: 84951803526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70659-3_12     Document Type: Conference Paper

References (15)

1. J.R. Ullmann, “An Algorithm for Subgraph Isomorphism”, Journal of the Association for Computing Machinery, vol. 23, pp. 31-42, 1976.
2. L.P. Cordella, P. Foggia, C. Sansone, M. Vento, “An Improved Algorithm for Matching Large Graphs”, Proc. of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations, Italy, pp. 149-159, 2001.
3. H. Bunke, X. Jiang and A. Kandel, “On the Minimum Supergraph of Two Graphs”, Computing 65, Nos. 13-25, pp. 13-25, 2000.
4. H. Bunke and K. Sharer, “A Graph Distance Metric Based on the Maximal Common Subgraph”, Pattern Recognition Letters, Vol. 19, Nos. 3-4, pp. 255-259, 1998.
5. G. Levi, “A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs”, Calcolo, Vol. 9, pp. 341-354, 1972.
6. M. M. Cone, Rengachari Venkataraghven, and F. W. McLafferty, “Molecular Structure Comparison Program for the Identification of Maximal Common Substructures”, Journal of Am. Chem. Soc”, 99(23), pp. 7668-7671 1977.
7. J.J. McGregor, “Backtrack Search Algorithms and the Maximal Common Subgraph Problem”, Software Practice and Experience, Vol. 12, pp. 23-34, 1982.
8. C. Bron and J. Kerbosch,“Finding All the Cliques in an Undirected Graph”, Communication of the Association for Computing Machinery 16, pp. 575-577,1973.
9. B. T. Messmer, “Efficient Graph Matching Algorithms for Preprocessed Model Graphs”, Ph.D. Thesis, Inst. of Comp. Science and Appl. Mathematics, University of Bern, 1996.
10. M. R. Garey, D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman & Co, New York, 1979.
11. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, “The Maximum Clique Problem”, Handbook of Combinatorial Optimization, vol. 4, Kluwer Academy Pub”, 1999.
12. P. J. Durand, R. Pasari, J. W. Baker, and Chun-che Tsai, “An Efficient Algorithm for Similarity Analysis of Molecules“, Internet Journal of Chemistry, vol. 2, 1999.
13. N. J. Nilsson, “Principles of Artificial Intelligence”, Springer-Verlag, 1982.
14. P. Foggia, C. Sansone, M. Vento, “A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking”, Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations, Italy, pp. 176-187, 2001.
15. H. Bunke, M. Gori, M. Hagenbuchner, C. Irniger, A.C. Tsoi, “Generation of Images Databases using Attributed Plex Grammars”, Proc. of the 3rd IAPR TC-15 International Workshop on Graph-based Representations, Italy, pp. 200-209, 2001.