Linear area upward drawings of AVL trees
From MaRDI portal
Publication:1384187
DOI10.1016/S0925-7721(97)00013-8zbMath0894.68100OpenAlexW2002246362MaRDI QIDQ1384187
Adolfo Piperno, Pierluigi Crescenzi, Paolo Penna
Publication date: 13 April 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00013-8
Related Items (8)
Logarithmic width, linear area upward drawing of AVL trees ⋮ Proximity drawings in polynomial area and volume ⋮ Drawing Halin-graphs with small height ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ A note on minimum-area upward drawing of complete and Fibonacci trees ⋮ Strictly-upward drawings of ordered search trees ⋮ Optimizing area and aspect ratio in straight-line orthogonal tree drawings ⋮ On embedding an outer-planar graph in a point set
Cites Work
- The complexity of drawing trees nicely
- A note on optimal area algorithms for upward drawings of binary trees
- Algorithms for drawing graphs: An annotated bibliography
- Universality considerations in VLSI circuits
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear area upward drawings of AVL trees
