Abstract
A graph g is called a maximum common subgraph of two graphs, g 1 and g 2, if there exists no other common subgraph of g 1 and g 2 that has more nodes than g. For the maximum common subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. In this paper, two exact algorithms for maximum common subgraph detection are described. Moreover a database containing randomly connected pairs of graphs, having a maximum common graph of at least two nodes, is presented, and the performance of the two algorithms is evaluated on this database.
Chapter PDF
Similar content being viewed by others
References
J.R. Ullmann, “An Algorithm for Subgraph Isomorphism”, Journal of the Association for Computing Machinery, vol. 23, pp. 31–42, 1976.
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.
H. Bunke X. Jiang and A. Kandel, “On the Minimum Supergraph of Two Graphs”, Computing 65, Nos. 13–25, pp. 13–25, 2000.
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.
G. Levi, “A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs”, Calcolo, Vol. 9, pp. 341–354, 1972.
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.
J.J. McGregor, “Backtrack Search Algorithms and the Maximal Common Subgraph Problem”, Software Practice and Experience, Vol. 12, pp. 23–34, 1982.
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.
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.
M. R. Garey, D. S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman & Co, New York, 1979.
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.
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.
N. J. Nilsson, “Principles of Artificial Intelligence”, Springer-Verlag, 1982.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M. (2002). A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs. In: Caelli, T., Amin, A., Duin, R.P.W., de Ridder, D., Kamel, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2002. Lecture Notes in Computer Science, vol 2396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-70659-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-70659-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44011-6
Online ISBN: 978-3-540-70659-5
eBook Packages: Springer Book Archive