Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs

  • Conference paper
  • First Online:
Graph Based Representations in Pattern Recognition (GbRPR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2726))

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, mainly for the lack of a large database of graphs. In this paper, three exact and well-known algorithms for maximum common subgraph detection are described. Moreover, a large database containing various categories of pairs of graphs (e.g. randomly connected graphs, meshes, bounded valence graphs...), having a maximum common subgraph of at least two nodes, is presented, and the performance of the three algorithms is evaluated on this database.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Bron and J. Kerbosch, “Finding All the Cliques in an Undirected Graph”, Communication of the ACM 16(1973), 575–577.

    Article  MATH  Google Scholar 

  2. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, “The Maximum Clique Problem”, Handbook of Combinatorial Optimization, vol. 4, Kluwer Academic Publisher, Boston Pattern MA, 1999.

    Google Scholar 

  3. H. Bunke, M. Vento, “Benchmarking of Graph Matching Algorithms”, Proc. 2nd IAPR TC-15 GbR Workshop, Haindorf, pp. 109–114, 1999.

    Google Scholar 

  4. M. De Santo, P. Foggia, C. Sansone, M. Vento, “A Large Database of Graphs and its use for Benchmarking Graph Isomorphism Algorithms” Pattern Recognition Letters, vol. 24, no. 8, pp. 1067–1079, 2003.

    Article  MATH  Google Scholar 

  5. J.J. McGregor, “Backtrack Search Algorithms and the Maximal Common Subgraph Problem”, Software Practice and Experience, Vol. 12, pp. 23–34, 1982.

    Article  MATH  Google Scholar 

  6. P. J. Durand, R. Pasari, J. W. Baker, and C.-C. Tsai, “An Efficient Algorithm for Similarity Analysis of Molecules”, Internet Journal of Chemistry, vol. 2, 1999.

    Google Scholar 

  7. E. Balas, C. S. Yu, “Finding a Maximum Clique in an Arbitrary Graph”, SIAM J. Computing, Vol. 15, No 4, 1986.

    Google Scholar 

  8. N. J. Nilsson, “Principles of Artificial Intelligence”, Springer-Verlag, 1982.

    Google Scholar 

  9. P. Foggia, C. Sansone, M. Vento, “A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking”, Proc. 3rd IAPR TC-15 GbR Workshop, Italy, pp. 176–187, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Informazione ed Ingegneria Elettrica, Università di Salerno, via P.te Don Melillo, I-84084, Fisciano (SA), Italy

    D. Conte

  2. Dipartimento di Informatica e Sistemistica, Università di Napoli “Federico II”, Via Claudio, 21, I-80125, Napoli, Italy

    C. Guidobaldi & C. Sansone

Authors
  1. D. Conte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Guidobaldi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Sansone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of York, York, YO1 5DD, UK

    Edwin Hancock

  2. D.I.I.I.E., Università degli Studi di Salerno, Via Ponte don Melillo, 1, 84084, Fisciano (SA), Italy

    Mario Vento

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Conte, D., Guidobaldi, C., Sansone, C. (2003). A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs. In: Hancock, E., Vento, M. (eds) Graph Based Representations in Pattern Recognition. GbRPR 2003. Lecture Notes in Computer Science, vol 2726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45028-9_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45028-9_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40452-1

  • Online ISBN: 978-3-540-45028-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation