The complexity of drawing trees nicely

DOI10.1007/BF00289576zbMath0493.68038MaRDI QIDQ1168727

Kenneth J. Supowit, Edward M. Reingold

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

drawings of binary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Functional Pearls ⋮ The realization problem for Euclidean minimum spanning trees is NP-hard ⋮ Linear area upward drawings of AVL trees ⋮ On Upward Drawings of Trees on a Given Grid ⋮ On circular layouts^∗ ⋮ Area requirement and symmetry display of planar upward drawings ⋮ Drawing orders using less ink ⋮ A note on optimal area algorithms for upward drawings of binary trees ⋮ Fixed edge-length graph drawing is NP-hard ⋮ Drawing plane graphs nicely ⋮ Depth-first layout algorithm for trees. ⋮ A linear time and space algorithm for finding isomorphic subtrees of a binary tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pretty-printing of trees
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• A numbering system for binary trees
• P-Complete Approximation Problems

This page was built for publication: The complexity of drawing trees nicely