Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs

  • Nils Kriege
  • Petra Mutzel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8635)


The complexity of the maximum common subgraph problem in partial k-trees is still largely unknown. We consider the restricted case, where the input graphs are k-connected partial k-trees and the common subgraph is required to be k-connected. For biconnected outerplanar graphs this problem is solved and the general problem was reported to be tractable by means of tree decomposition techniques. We discuss key obstacles of tree decompositions arising for common subgraph problems that were ignored by previous algorithms and do not occur in outerplanar graphs. We introduce the concept of potential separators, i.e., separators of a subgraph to be searched that not necessarily are separators of the input graph. We characterize these separators and propose a polynomial time solution for series-parallel graphs based on SP-trees.


Tree decomposition maximum common subgraph series-parallel graph 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals E76-A(9) (1993)Google Scholar
  2. 2.
    Akutsu, T., Tamura, T.: On the complexity of the maximum common subgraph problem for partial k-trees of bounded degree. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol. 7676, pp. 146–155. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  3. 3.
    Akutsu, T., Tamura, T.: A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree. Algorithms 6(1), 119–135 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bachl, S., Brandenburg, F.J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms Appl. 8(2), 215–238 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Dessmark, A., Lingas, A., Proskurowski, A.: Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Algorithmica 27, 337–347 (2000)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Gupta, A., Nishimura, N.: Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 172–182. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  7. 7.
    Gupta, A., Nishimura, N.: The complexity of subgraph isomorphism for classes of partial k-trees. Theoretical Computer Science 164(1-2), 287–298 (1996)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Hajiaghayi, M., Nishimura, N.: Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. System Sci. 73(5), 755 (2007)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Matoušek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics 108(1-3), 343–364 (1992)zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Matula, D.W.: Subtree isomorphism in O(n 5/2). In: Algorithmic Aspects of Combinatorics. Ann. Discrete Math., vol. 2, p. 91 (1978)Google Scholar
  11. 11.
    Schietgat, L., Ramon, J., Bruynooghe, M.: A polynomial-time metric for outerplanar graphs. In: Mining and Learning with Graphs, MLG 2007, Firence, Italy, August 1-3 (2007)Google Scholar
  12. 12.
    Sysło, M.M.: The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science 17(1), 91–97 (1982)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    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. Process. Lett. 92(2), 57–63 (2004)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Nils Kriege
    • 1
  • Petra Mutzel
    • 1
  1. 1.Dept. of Computer ScienceTechnische Universität DortmundGermany

Personalised recommendations