The complexity of drawing trees nicely

DOI10.1007/BF00289576MaRDI QIDQ1168727zbMATH OpenFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A numbering system for binary trees
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• P-Complete Approximation Problems
• Pretty-printing of trees

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168727)