Pages that link to "Item:Q5199228"
From MaRDI portal
The following pages link to On the Area Requirements of Euclidean Minimum Spanning Trees (Q5199228):
Displaying 8 items.
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Approximate Proximity Drawings (Q3223952) (← links)
- On the number of leaves of a euclidean minimal spanning tree (Q3780174) (← links)
- Testing Euclidean minimum spanning trees in the plane (Q4962736) (← links)