Pages that link to "Item:Q414909"
From MaRDI portal
The following pages link to Drawing a tree as a minimum spanning tree approximation (Q414909):
Displaying 7 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Drawing graphs as spanners (Q5918794) (← links)