The Utility of Untangling

DOI10.7155/jgaa.00407zbMath1358.05195arXiv1506.04092OpenAlexW2574220995MaRDI QIDQ5892357

Vida Dujmović

Publication date: 5 April 2017

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.04092

zbMATH Keywords

geometric graphscrossingsuntangling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Dual circumference and collinear sets ⋮ Minimal representations of order types by geometric graphs ⋮ Minimal Representations of Order Types by Geometric Graphs ⋮ Every collinear set in a planar graph is free ⋮ Unnamed Item ⋮ Aligned Drawings of Planar Graphs

This page was built for publication: The Utility of Untangling