A near-linear area bound for drawing binary trees
From MaRDI portal
Publication:1849677
DOI10.1007/s00453-002-0937-xzbMath1041.68124OpenAlexW3139225691MaRDI QIDQ1849677
Publication date: 1 December 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-0937-x
Related Items (17)
PROXIMITY DRAWINGS OF HIGH-DEGREE TREES ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Tree drawings revisited ⋮ Drawing a tree as a minimum spanning tree approximation ⋮ ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS ⋮ On the edge-length ratio of planar graphs ⋮ Ideal Drawings of Rooted Trees With Approximately Optimal Width ⋮ Polynomial area bounds for MST embeddings of trees ⋮ AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ How to fit a tree in a box ⋮ Unnamed Item ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees ⋮ Small area drawings of outerplanar graphs ⋮ How to draw a clustered tree ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees
This page was built for publication: A near-linear area bound for drawing binary trees
