Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
From MaRDI portal
Publication:2936910
DOI10.1007/978-3-662-45803-7_2zbMath1426.68224arXiv1311.6839OpenAlexW2132851555MaRDI QIDQ2936910
Publication date: 7 January 2015
Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.6839
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
The Complexity of Drawing a Graph in a Polygonal Region ⋮ Hanani--Tutte and Hierarchical Partial Planarity ⋮ RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Graph Stories in Small Area ⋮ Graph stories in small area ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Hierarchical partial planarity ⋮ Planarity of streamed graphs
This page was built for publication: Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
