Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
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.
KeywordsTree decomposition maximum common subgraph series-parallel graph
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(9) (1993)Google Scholar
- 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.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