The following pages link to TWO TREE DRAWING CONVENTIONS (Q3136721):
Displaying 6 items.
- On the approximability of two tree drawing conventions (Q294876) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
