A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree

Authors:
Tatsuya Akutsu;Takeyuki Tamura
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto, Japan
Venue:
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Year:
2012

Citing 6
Cited 0

Subgraph isomorphism for biconnected outerplanar graphs in cubic time

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Approximability of the Maximum Common Subgraph Problem

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees

Information Processing Letters
Frequent subgraph mining in outerplanar graphs

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the maximum common subgraph problem, which is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs. This paper presents a dynamic programming algorithm for computing the maximum common subgraph of two outerplanar graphs whose maximum vertex degree is bounded by a constant, where it is known that the problem is NP-hard even for outerplanar graphs of unbounded degree. Although the algorithm repeatedly modifies input graphs, it is shown that the number of relevant subproblems is polynomially bounded and thus the algorithm works in polynomial time.