Drawing a tree as a minimum spanning tree approximation

DOI10.1016/j.jcss.2011.06.001zbMath1237.68132OpenAlexW2089168252WikidataQ62042451 ScholiaQ62042451MaRDI QIDQ414909

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

Publication date: 11 May 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.06.001

zbMATH Keywords

geometric graphsgraph drawingEuclidean minimum spanning treeapproximated proximity

Mathematics Subject Classification ID

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

Related Items

Approximate proximity drawings ⋮ Drawing graphs as spanners ⋮ The approximate rectangle of influence drawability problem

Cites Work

• Unnamed Item
• Unnamed Item
• Transitions in geometric minimum spanning trees
• A near-linear area bound for drawing binary trees
• The realization problem for Euclidean minimum spanning trees is NP-hard
• Drawing a Tree as a Minimum Spanning Tree Approximation
• Drawing Trees with Perfect Angular Resolution and Polynomial Area
• Universality considerations in VLSI circuits
• Computing proximity drawings of trees in the 3-dimensional space
• Polynomial Area Bounds for MST Embeddings of Trees
• Drawing graphs. Methods and models

This page was built for publication: Drawing a tree as a minimum spanning tree approximation