Next Article in Journal
Algorithms for Non-Negatively Constrained Maximum Penalized Likelihood Reconstruction in Tomographic Imaging
Next Article in Special Issue
New Heuristics for Rooted Triplet Consistency
Previous Article in Journal / Special Issue
Computing the Eccentricity Distribution of Large Graphs
Article

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

Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan
*
Author to whom correspondence should be addressed.
Algorithms 2013, 6(1), 119-135; https://doi.org/10.3390/a6010119
Received: 30 October 2012 / Revised: 27 January 2013 / Accepted: 7 February 2013 / Published: 18 February 2013
(This article belongs to the Special Issue Graph Algorithms)
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. View Full-Text
Keywords: maximum common subgraph; outerplanar graph; dynamic programming maximum common subgraph; outerplanar graph; dynamic programming
Show Figures

Figure 1

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. https://doi.org/10.3390/a6010119

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. https://doi.org/10.3390/a6010119

Chicago/Turabian Style

Akutsu, Tatsuya, and Takeyuki Tamura. 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. https://doi.org/10.3390/a6010119

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop