Abstract
We study the problem of finding a minimum tree spanning the faces of a given planar graph. We show that a constant factor approximation follows from the unconnected version if the minimum degree is 3. Moreover, we present a polynomial time approximation scheme for both the connected and unconnected version. © 2010 Springer-Verlag.
Cite
CITATION STYLE
APA
Grigoriev, A., & Sitters, R. (2010). Connected feedback vertex set in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5911 LNCS, pp. 143–153). https://doi.org/10.1007/978-3-642-11409-0_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free