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

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

Abstract

Abstract is missing.