Untangling a Planar Graph

DOI10.1007/978-3-540-77566-9_41MaRDI QIDQ5448674zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Untangling a planar graph
• Moving Vertices to Make Drawings Plane
• Untangling polygons and graphs
• Untangling polygons and graphs
• A polynomial bound for untangling geometric planar graphs

Cited in

(13)

• A polynomial bound for untangling geometric planar graphs
• Untangling a planar graph
• Unravelling tangled graphs
• UNKNOTTING SINGULAR CHARTS WITH NO BLACK VERTICES BY REDUCING NODE-PAIRS
• Upper Bound Constructions for Untangling Planar Geometric Graphs
• Unraveling k-page graphs
• Geometry and generation of a new graph planarity game
• Untangling polygons and graphs
• A Polynomial Bound for Untangling Geometric Planar Graphs
• Untangling planar graphs from a specified vertex position-Hard cases
• Moving Vertices to Make Drawings Plane
• Untangling polygons and graphs
• On the obfuscation complexity of planar graphs

This page was built for publication: Untangling a Planar Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448674)