How to fit a tree in a box

DOI10.1007/978-3-030-04414-5_26OpenAlexW2889480905MaRDI QIDQ5915945

Irene Parada, Hugo A. Akitaya, Maarten Löffler

Publication date: 15 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

How to fit a tree in a box ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• A note on optimal area algorithms for upward drawings of binary trees
• Drawing Unordered Trees on k-Grids
• Ideal Drawings of Rooted Trees With Approximately Optimal Width
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• On Upward Drawings of Trees on a Given Grid
• How to fit a tree in a box