On Upward Drawings of Trees on a Given Grid

DOI10.1007/978-3-319-73915-1_25zbMath1503.68209arXiv1708.09515OpenAlexW2751193394MaRDI QIDQ4625120

Debajyoti Mondal, Therese C. Biedl

Publication date: 20 February 2019

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

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

On Upward Drawings of Trees on a Given Grid ⋮ How to fit a tree in a box ⋮ 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 minimum-area upward drawing of complete and Fibonacci trees
• The complexity of minimizing wire lengths in VLSI layouts
• Unit-length embedding of binary trees on a square grid
• The complexity of drawing trees nicely
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
• Drawing Ordered (k − 1)–Ary Trees on k–Grids
• Minimum-Layer Upward Drawings of Trees
• Minimum-Layer Drawings of Trees
• Minimum-Area Drawings of Plane 3-Trees
• NP-Completeness of Minimal Width Unordered Tree Layout
• On Upward Drawings of Trees on a Given Grid
• Drawing Unordered Trees on k-Grids
• On Area-Optimal Planar Graph Drawings
• Minimizing the Area for Planar Straight-Line Grid Drawings

This page was built for publication: On Upward Drawings of Trees on a Given Grid