The Utility of Untangling

DOI10.1007/978-3-319-27261-0_27zbMath1471.68191OpenAlexW2964271160MaRDI QIDQ5892273

Vida Dujmović

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27261-0_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Drawing Planar Graphs with Many Collinear Vertices ⋮ Small universal point sets for \(k\)-outerplanar graphs

This page was built for publication: The Utility of Untangling