Pages that link to "Item:Q1849677"
From MaRDI portal
The following pages link to A near-linear area bound for drawing binary trees (Q1849677):
Displayed 17 items.
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- Tree drawings revisited (Q2189731) (← links)
- On the edge-length ratio of planar graphs (Q2206847) (← links)
- Ideal Drawings of Rooted Trees With Approximately Optimal Width (Q2985123) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS (Q3520432) (← links)
- AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES (Q4661881) (← links)
- Improved Upper and Lower Bounds for LR Drawings of Binary Trees (Q5014106) (← links)
- (Q5115791) (← links)
- How to fit a tree in a box (Q5925577) (← links)