Untangling a Planar Graph
From MaRDI portal
Publication:5448674
DOI10.1007/978-3-540-77566-9_41zbMath1132.68511MaRDI QIDQ5448674
Andreas Spillner, Alexander Wolff
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_41
91A43: Games involving graphs
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Untangling planar graphs from a specified vertex position-Hard cases, On the obfuscation complexity of planar graphs, A polynomial bound for untangling geometric planar graphs, Untangling a planar graph