Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees
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.
Unable to display preview. Download preview PDF.
- 1.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
- 5.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)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman (1987)Google Scholar
- 8.Gupta, A., Nishimura, N.: The complexity of subgraph isomorphisms for classes of partial k-trees. Theoret. Comput. Sci. 30, 402–404 (2002)Google Scholar
- 10.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)Google Scholar
- 11.van Leeuwen, J.: Handbook of Theoretical Computer Science. Algorithm and Complexity, vol. A. Elsevier Science Pub., Amsterdam (1990)Google Scholar
- 13.Sanders, D.: On linear recognition of tree-width at most four. SIAM J. Discrete Math. 108, 343–364 (1992)Google Scholar