Abstract
The maximum common subgraph problem is NP-hard even if the two input graphs are partial k-trees. We present a polynomial time algorithm for finding the maximum common connected induced subgraph of two bounded degree graphs G 1 and G 2, where G 1 is a partial k-tree and G 2 is a graph whose possible spanning trees are polynomially bounded. The key idea of our algorithm is that for each spanning tree generated from G 2, a candidate for the maximum common connected induced subgraph is generated in polynomial time since a subgraph of a partial k-tree is also a partial k-tree. Among all of these candidates, we can find the maximum common connected induced subgraph for G 1 and G 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. on Algebraic and Discrete Methods 8, 277–284 (1987)
Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems on graphs embedded in k-trees. Discrete Appl. Math. 23, 11–24 (1989)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Bayada, D.M., Simpson, R.W., Johnson, A.P.: An algorithm for the multiple common subgraph problem. J. Chem. Inf. Comput. Sci. 32, 680–685 (1992)
Ding, G.: Graphs with not too many spanning trees. Networks 25, 193–197 (1995)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1987)
Gupta, A., Nishimura, N.: The complexity of subgraph isomorphisms for classes of partial k-trees. Theoret. Comput. Sci. 30, 402–404 (2002)
Goto, S., Okuno, Y., Hattori, M., Nishioka, T., Kanehisa, M.: LIGAND: database of chemical compounds and reactions in biological pathways. Nucleic Acids Res. 30, 402–404 (2002)
Kann, V.: On the approximability of the maximum common subgraph problem. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 377–388. Springer, Heidelberg (1992)
van Leeuwen, J.: Handbook of Theoretical Computer Science. Algorithm and Complexity, vol. A. Elsevier Science Pub., Amsterdam (1990)
Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Math. 108, 343–364 (1992)
Sanders, D.: On linear recognition of tree-width at most four. SIAM J. Discrete Math. 108, 343–364 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamaguchi, A., Mamitsuka, H. (2003). Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees. In: Ibaraki, T., Katoh, N., Ono, H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24587-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-24587-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20695-8
Online ISBN: 978-3-540-24587-2
eBook Packages: Springer Book Archive