A Polynomial Bound for Untangling Geometric Planar Graphs

DOI10.1016/J.ENDM.2008.06.042zbMATH Open1267.05073OpenAlexW2039715981MaRDI QIDQ5301009FDOQ5301009

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

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

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

Cites Work

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

Cited In (5)

• Untangling planar graphs from a specified vertex position-Hard cases
• On the obfuscation complexity of planar graphs
• Untangling a planar graph
• Untangling polygons and graphs
• Upper Bound Constructions for Untangling Planar Geometric Graphs

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

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