Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)

DOI10.7155/jgaa.00515zbMath1444.05098arXiv1606.02233OpenAlexW3003671720MaRDI QIDQ5208867

Johannes Batzill, Therese C. Biedl

Publication date: 22 January 2020

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

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

zbMATH Keywords

pathwidth

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Drawing Halin-graphs with small height

Cites Work

• Unnamed Item
• Unnamed Item
• A note on optimal area algorithms for upward drawings of binary trees
• The rectangle of influence drawability problem
• Ideal Drawings of Rooted Trees With Approximately Optimal Width
• 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
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• How to fit a tree in a box

This page was built for publication: Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)