Skip to main content
SpringerLink
Log in

On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree

  • Conference paper
Algorithms and Computation (ISAAC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7676))

Included in the following conference series:

Abstract

This paper considers two versions of the maximum common subgraph problem for vertex-labeled graphs: the maximum common connected edge subgraph problem and the maximum common connected induced subgraph problem. The former is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs. The latter is to find a common connected induced subgraph with the maximum number of vertices. This paper shows that both problems are NP-hard even for labeled partial k-trees of bounded degree. It also presents some exponential-time algorithms for both problems.

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. Abu-Khzam, F.N., Samatova, N.F., Rizk, M.A., Langston, M.A.: The maximum common subgraph problem: faster solutions via vertex cover. In: Proc. 2007 IEEE/ACS Int. Conf. Computer Systems and Applications, pp. 367–373. IEEE (2007)

    Google Scholar 

  2. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals E76-A, 1488–1493 (1993)

    Google Scholar 

  3. Akutsu, T., Tamura, T.: A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 76–87. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Babai, L.: Luks. E. M.: Canonical labeling of graphs. In: Proc. 15th ACM Symp. Theory of Computing, pp. 171–183. ACM Press (1983)

    Google Scholar 

  5. Bachl, S., Brandenburg, F.-J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms and Applications 8, 215–238 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognition and Artificial Intelligence 18, 265–298 (2004)

    Article  Google Scholar 

  7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)

    MATH  Google Scholar 

  9. Hajiaghayi, M., Nishimura, N.: Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73, 755–768 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Horváth, T., Ramon, J.: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theoret. Comput. Sci. 411, 2784–2797 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  11. Huang, X., Lai, J., Jennings, S.F.: Maximum common subgraph: some upper bound and lower bound results. BMC Bioinformatics 7(suppl. 4), S-4 (2006)

    Google Scholar 

  12. Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput. 24, 1122–1139 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kann, V.: On the Approximability of the Maximum Common Subgraph Problem. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 375–388. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  14. Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci. 63, 295–302 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  15. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25, 42–65 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  16. Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Math. 108, 343–364 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Raymond, J.W., Willett, P.: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Computer-Aided Molecular Design 16, 521–533 (2002)

    Article  Google Scholar 

  18. Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Proc. Workshop on Mining and Learning with Graphs (2007)

    Google Scholar 

  19. Shearer, K., Bunke, H., Venkatesh, S.: Video indexing and similarity retrieval by largest common subgraph detection using decision trees. Pattern Recognition 34, 1075–1091 (2001)

    Article  MATH  Google Scholar 

  20. Syslo, M.M.: The subgraph isomorphism problem for outerplanar graphs. Theoret. Comput. Sci. 17, 91–97 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yamaguchi, A., Aoki, K.F., Mamitsuka, H.: Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. Inf. Proc. Lett. 92, 57–63 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zemlyachenko, V.M., Kornienko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. J. Soviet Math. 29, 1426–1481 (1985)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, 611-0011, Japan

    Tatsuya Akutsu & Takeyuki Tamura

Authors
  1. Tatsuya Akutsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takeyuki Tamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Information Engineering, National Taiwan University, 1 Roosevelt Road, Section 4, 106, Taipei, Taiwan

    Kun-Mao Chao

  2. Institute of Information Science, Academia Sinica, 128 Academia Road, Section 2, 115, Taipei, Taiwan

    Tsan-sheng Hsu

  3. Department of Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, 402, Taichung, Taiwan

    Der-Tsai Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Akutsu, T., Tamura, T. (2012). On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35261-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35260-7

  • Online ISBN: 978-3-642-35261-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation