Polynomial Area Bounds for MST Embeddings of Trees

DOI10.1007/978-3-540-77537-9_12zbMath1137.68496OpenAlexW1495194784MaRDI QIDQ5452214

Michael Kaufmann

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Drawing a tree as a minimum spanning tree approximation, Polynomial area bounds for MST embeddings of trees

Cites Work

• Unnamed Item
• Transitions in geometric minimum spanning trees
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Computing proximity drawings of trees in the 3-dimensional space