Untangling a Planar Graph

DOI10.1007/978-3-540-77566-9_41zbMath1132.68511OpenAlexW1577386848MaRDI 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

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

A Polynomial Bound for Untangling Geometric Planar Graphs ⋮ On the obfuscation complexity of planar graphs ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ Untangling polygons and graphs ⋮ A polynomial bound for untangling geometric planar graphs ⋮ Untangling a planar graph

This page was built for publication: Untangling a Planar Graph