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

Tatsuya Akutsu, Takeyuki Tamura

Browse the full MFCS paper archive.