Drawing a Tree as a Minimum Spanning Tree Approximation

DOI10.1007/978-3-642-17514-5_6zbMath1310.68159WikidataQ62042515 ScholiaQ62042515MaRDI QIDQ3060761

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk G. Meijer

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_6

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

On the area requirements of Euclidean minimum spanning trees, Drawing a tree as a minimum spanning tree approximation, Polynomial area bounds for MST embeddings of trees, Approximate Proximity Drawings