Polynomial Area Bounds for MST Embeddings of Trees

DOI10.1007/978-3-540-77537-9_12zbMATH Open1137.68496OpenAlexW1495194784MaRDI QIDQ5452214FDOQ5452214

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

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

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)

Cites Work

• Computing proximity drawings of trees in the 3-dimensional space
• Title not available (Why is that?)
• Transitions in geometric minimum spanning trees
• The realization problem for Euclidean minimum spanning trees is NP-hard

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)