Drawing a tree as a minimum spanning tree approximation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- A near-linear area bound for drawing binary trees
- Computing proximity drawings of trees in the 3-dimensional space
- Drawing Trees with Perfect Angular Resolution and Polynomial Area
- Drawing a tree as a minimum spanning tree approximation
- Drawing graphs. Methods and models
- Polynomial Area Bounds for MST Embeddings of Trees
- 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
- The approximate rectangle of influence drawability problem
- Drawing a tree as a minimum spanning tree approximation
- On the area requirements of Euclidean minimum spanning trees
- Proximity drawings of high-degree trees
- Approximate proximity drawings
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree
- Polynomial Area Bounds for MST Embeddings of Trees
- Polynomial area bounds for MST embeddings of trees
- Drawing graphs as spanners
- 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)
