How to fit a tree in a box

DOI10.1007/s00373-022-02558-zzbMath1497.05185OpenAlexW4294677224MaRDI QIDQ5925577

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

Publication date: 28 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02558-z

zbMATH Keywords

graph drawingbinary treesarea requirementupward drawing

Mathematics Subject Classification ID

Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unit-length embedding of binary trees on a square grid
• A note on optimal area algorithms for upward drawings of binary trees
• The logic engine and the realization problem for nearest neighbor graphs
• A near-linear area bound for drawing binary trees
• Drawing Unordered Trees on k-Grids
• Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio
• On Upward Drawings of Trees on a Given Grid
• Reducibility among Combinatorial Problems
• Minimizing the Area for Planar Straight-Line Grid Drawings
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA

This page was built for publication: How to fit a tree in a box