A Polynomial Bound for Untangling Geometric Planar Graphs

DOI10.1016/j.endm.2008.06.042zbMath1267.05073OpenAlexW2039715981MaRDI QIDQ5301009

Prosenjit Bose, Stefan Langerman, Vida Dujmović, Pat Morin, David R. Wood, Ferran Hurtado

Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/9583

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On the obfuscation complexity of planar graphs ⋮ Untangling polygons and graphs ⋮ Untangling a planar graph

Cites Work

• How to draw a planar graph on a grid
• Untangling a polygon
• Convex Drawings of Graphs with Non-convex Boundary
• Untangling a Planar Graph

This page was built for publication: A Polynomial Bound for Untangling Geometric Planar Graphs