On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree

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

Volumn 7676 LNCS, Issue , 2012, Pages 146-155

  Akutsu, Tatsuya ^a   Tamura, Takeyuki ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Maximum common subgraph; NP hard; Partial k tree; Treewidth

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXPONENTIAL TIME ALGORITHM; INDUCED SUBGRAPHS; MAXIMUM COMMON SUBGRAPH; NP-HARD; PARTIAL K-TREES; SUBGRAPH PROBLEMS; TREE-WIDTH; VERTEX-LABELED GRAPHS;

TREES (MATHEMATICS);

EID: 84871533881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35261-4_18     Document Type: Conference Paper

References (22)

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)
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)
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)
4. Babai, L.: Luks. E. M.: Canonical labeling of graphs. In: Proc. 15th ACM Symp. Theory of Computing, pp. 171-183. ACM Press (1983)
5. Bachl, S., Brandenburg, F.-J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms and Applications 8, 215-238 (2004)
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)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
9. Hajiaghayi, M., Nishimura, N.: Subgraph isomorphism, log-bounded fragmentation and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73, 755-768 (2007)
10. Horváth, T., Ramon, J.: Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theoret. Comput. Sci. 411, 2784-2797 (2010)
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)
12. Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput. 24, 1122-1139 (1995)
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)
14. Lingas, A.: Subgraph isomorphism for biconnected outerplanar graphs in cubic time. Theoret. Comput. Sci. 63, 295-302 (1989)
15. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25, 42-65 (1982)
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)
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)
18. Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Proc. Workshop on Mining and Learning with Graphs (2007)
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)
20. Syslo, M.M.: The subgraph isomorphism problem for outerplanar graphs. Theoret. Comput. Sci. 17, 91-97 (1982)
21. Yamaguchi, A., Aoki, K.F., Mamitsuka, H.: Finding the maximum common sub-graph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. Inf. Proc. Lett. 92, 57-63 (2004)
22. Zemlyachenko, V.M., Kornienko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. J. Soviet Math. 29, 1426-1481 (1985)