Drawing Halin-graphs with small height

DOI10.7155/JGAA.00604zbMath1499.68254arXiv2003.14413OpenAlexW3015049257MaRDI QIDQ5050008

Milap Sheth, Therese C. Biedl

Publication date: 14 November 2022

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.14413

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• VPG and EPG bend-numbers of Halin graphs
• Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
• Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
• How to draw a planar graph on a grid
• Dominating cycles in Halin graphs
• A note on optimal area algorithms for upward drawings of binary trees
• Linear area upward drawings of AVL trees
• LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs
• Horton-Strahler number, rooted pathwidth and upward drawings of trees
• Tree drawings revisited
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Height-Preserving Transformations of Planar Graph Drawings
• Towards an implementation of the 3D visibility skeleton
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE DRAWINGS OF ORDERED TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
• Simple Recognition of Halin Graphs and Their Generalizations
• A 3-approximation for the pathwidth of Halin graphs

This page was built for publication: Drawing Halin-graphs with small height