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. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kriege, N., & Mutzel, P. (2014). Finding maximum common biconnected subgraphs in series-parallel graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8635 LNCS, pp. 505–516). Springer Verlag. https://doi.org/10.1007/978-3-662-44465-8_43
Mendeley helps you to discover research relevant for your work.