Abstract
We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 2) leads to NP-hard problems. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Kranakis, E., Morales Ponce, O., & Suomela, J. (2011). Planar subgraphs without low-degree nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 583–594). https://doi.org/10.1007/978-3-642-22300-6_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
