The following pages link to Pretty-printing of trees (Q3868755):
Displaying 10 items.
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- Three-dimensional graph drawing (Q675316) (← links)
- Drawing plane graphs nicely (Q797289) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Constructing format-preserving printing from syntax-directed definitions (Q5046488) (← links)
- Functional Pearls (Q5687910) (← links)
- Functional Pearls (Q5687913) (← links)
- Optimal binary search trees (Q5906917) (← links)
