Algorithms 2013, 6(1), 119-135; doi:10.3390/a6010119
Article

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

* email and email
Received: 30 October 2012; in revised form: 27 January 2013 / Accepted: 7 February 2013 / Published: 18 February 2013
(This article belongs to the Special Issue Graph Algorithms)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: The maximum common connected edge subgraph problem 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, where it has applications in pattern recognition and chemistry. This paper presents a dynamic programming algorithm for the problem when the two input graphs are outerplanar graphs of a bounded vertex degree, where it is known that the problem is NP-hard, even for outerplanar graphs of an 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.
Keywords: maximum common subgraph; outerplanar graph; dynamic programming
PDF Full-text Download PDF Full-Text [200 KB, uploaded 18 February 2013 08:17 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

Akutsu, T.; Tamura, T. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms 2013, 6, 119-135.

AMA Style

Akutsu T, Tamura T. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms. 2013; 6(1):119-135.

Chicago/Turabian Style

Akutsu, Tatsuya; Tamura, Takeyuki. 2013. "A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree." Algorithms 6, no. 1: 119-135.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert