Pages that link to "Item:Q390122"
From MaRDI portal
The following pages link to On the area requirements of Euclidean minimum spanning trees (Q390122):
Displaying 8 items.
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- Testing Euclidean minimum spanning trees in the plane (Q4962736) (← links)
- Drawing graphs as spanners (Q5918794) (← links)