Polynomial Area Bounds for MST Embeddings of Trees

DOI10.1007/978-3-540-77537-9_12MaRDI QIDQ5452214zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Polynomial area bounds for MST embeddings of trees
• On the area requirements of Euclidean minimum spanning trees
• On the area requirements of Euclidean minimum spanning trees
• Drawing a tree as a minimum spanning tree approximation
• Drawing a tree as a minimum spanning tree approximation

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Computing proximity drawings of trees in the 3-dimensional space
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Transitions in geometric minimum spanning trees

Cited in

(4)

• Polynomial area bounds for MST embeddings of trees
• Drawing a tree as a minimum spanning tree approximation
• On the area requirements of Euclidean minimum spanning trees
• On the area requirements of Euclidean minimum spanning trees

This page was built for publication: Polynomial Area Bounds for MST Embeddings of Trees

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