Minimum-Layer Drawings of Trees

DOI10.1007/978-3-642-19094-0_23zbMath1317.68136OpenAlexW1305143MaRDI QIDQ3078403

Md. Jawaherul Alam, Md. Saidur Rahman, Debajyoti Mondal

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_23

zbMATH Keywords

layered drawingtree drawingminimum layer

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On Upward Drawings of Trees on a Given Grid ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Drawing Planar Graphs with Reduced Height ⋮ Horton-Strahler number, rooted pathwidth and upward drawings of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-Layer Upward Drawings of Trees
• Drawing Graphs on Two and Three Lines
• NP-Completeness of Minimal Width Unordered Tree Layout
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions