This paper describes a general technique that can be used to obtain approximation schemes for various NP-complete problems on planar graphs. The strategy depends on decomposing a planar graph into subgraphs of a form we call k-outerplanar.
No takes yet. Share an insight, caveat, or question.
Brenda S. Baker (1994) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: