Pages that link to "Item:Q1168727"
From MaRDI portal
The following pages link to The complexity of drawing trees nicely (Q1168727):
Displaying 12 items.
- Drawing plane graphs nicely (Q797289) (← links)
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree (Q802874) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Drawing orders using less ink (Q1205151) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Depth-first layout algorithm for trees. (Q2583560) (← links)
- On circular layouts<sup>∗</sup> (Q3806838) (← links)
- On Upward Drawings of Trees on a Given Grid (Q4625120) (← links)
- Functional Pearls (Q5687910) (← links)
