Strictly-upward drawings of ordered search trees

DOI10.1016/S0304-3975(97)00287-9zbMath0913.68145MaRDI QIDQ1274319

Pierluigi Crescenzi, Paolo Penna

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph drawingarea requirementupward drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (5)

Proximity drawings in polynomial area and volume ⋮ Tree drawings revisited ⋮ AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES ⋮ Unnamed Item ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees

Cites Work

• Unnamed Item
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for drawing graphs: An annotated bibliography
• Linear area upward drawings of AVL trees
• Universality considerations in VLSI circuits
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

This page was built for publication: Strictly-upward drawings of ordered search trees