Drawing a Tree as a Minimum Spanning Tree Approximation

DOI10.1007/978-3-642-17514-5_6zbMath1310.68159OpenAlexW1507697328WikidataQ62042515 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

Analysis of algorithms and problem complexity (68Q25) 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 (4)

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

This page was built for publication: Drawing a Tree as a Minimum Spanning Tree Approximation