I'm Looking for a list of algorithms that are more efficient for an outerplanar graph than for an arbitrary graph.I found only the following: A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree.Especially I'm looking for an elegant improvement and an easy to explain algorithm.Thanks.
Looking for a list of algorithms that are more efficient for an outerplanar graph than for an arbitrary graph
graph theory;graph algorithms