Horton-Strahler number, rooted pathwidth and upward drawings of trees

DOI10.1016/j.ipl.2021.106230OpenAlexW3217771213MaRDI QIDQ2059912

Therese C. Biedl

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106230

zbMATH Keywords

pathwidthcomputational geometryHorton-Strahler numberrooted pathwidthupward tree drawing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Drawing Halin-graphs with small height ⋮ Morphing tree drawings in a small 3D grid

Cites Work

• Unnamed Item
• On the parameterized complexity of layered graph drawing
• A note on optimal area algorithms for upward drawings of binary trees
• A partial k-arboretum of graphs with bounded treewidth
• The vertex separation and search number of a graph
• A data structure for dynamic trees
• A near-linear area bound for drawing binary trees
• Tree drawings revisited
• A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• Ideal Drawings of Rooted Trees With Approximately Optimal Width
• Minimum-Layer Upward Drawings of Trees
• Minimum-Layer Drawings of Trees
• On Upward Drawings of Trees on a Given Grid
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• How to fit a tree in a box

This page was built for publication: Horton-Strahler number, rooted pathwidth and upward drawings of trees