Drawing a tree as a minimum spanning tree approximation
From MaRDI portal
Publication:414909
DOI10.1016/J.JCSS.2011.06.001zbMATH Open1237.68132OpenAlexW2089168252WikidataQ62042451 ScholiaQ62042451MaRDI QIDQ414909FDOQ414909
Authors: Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Computing proximity drawings of trees in the 3-dimensional space
- Title not available (Why is that?)
- Drawing graphs. Methods and models
- A near-linear area bound for drawing binary trees
- Universality considerations in VLSI circuits
- Transitions in geometric minimum spanning 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
- Polynomial Area Bounds for MST Embeddings of Trees
Cited In (11)
- Drawing a tree as a minimum spanning tree approximation
- Polynomial area bounds for MST embeddings of trees
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- Polynomial Area Bounds for MST Embeddings of Trees
- The approximate rectangle of influence drawability problem
- Drawing graphs as spanners
- How to draw a clustered tree
- Approximate proximity drawings
- On the area requirements of Euclidean minimum spanning trees
- Proximity drawings of high-degree trees
- On the area requirements of Euclidean minimum spanning trees
This page was built for publication: Drawing a tree as a minimum spanning tree approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414909)
