Pages that link to "Item:Q654291"
From MaRDI portal
The following pages link to Polynomial area bounds for MST embeddings of trees (Q654291):
Displaying 6 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Drawing graphs as spanners (Q5918794) (← links)