Drawing a tree as a minimum spanning tree approximation
From MaRDI portal
Recommendations
Cites work
- A near-linear area bound for drawing binary trees
- Computing proximity drawings of trees in the 3-dimensional space
- Drawing a tree as a minimum spanning tree approximation
- Drawing graphs. Methods and models
- Drawing Trees with Perfect Angular Resolution and Polynomial Area
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Polynomial Area Bounds for MST Embeddings of Trees
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- The realization problem for Euclidean minimum spanning trees is NP-hard
- Transitions in geometric minimum spanning trees
- Universality considerations in VLSI circuits
Cited in
(11)- How to draw a clustered tree
- Approximate proximity drawings
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- The approximate rectangle of influence drawability problem
- Drawing a tree as a minimum spanning tree approximation
- Proximity drawings of high-degree trees
- On the area requirements of Euclidean minimum spanning trees
- On the area requirements of Euclidean minimum spanning trees
- Polynomial Area Bounds for MST Embeddings of Trees
- Drawing graphs as spanners
- Polynomial area bounds for MST embeddings of 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)