Volume requirements of 3D upward drawings

DOI10.1016/j.disc.2007.12.061zbMath1182.05087OpenAlexW2051202422WikidataQ62042552 ScholiaQ62042552MaRDI QIDQ1011762

Stephen K. Wismath, Giuseppe Liotta, Henk G. Meijer, Emilio Di Giacomo

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.061

zbMATH Keywords

directed acyclic graphgraph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Layered separators in minor-closed graph classes with applications ⋮ Improved Bounds for Track Numbers of Planar Graphs ⋮ Layouts of Expander Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 3D straight-line grid drawing of 4-colorable graphs
• Three-dimensional graph drawing
• Upward drawings of triconnected digraphs.
• Area requirement and symmetry display of planar upward drawings
• Computing straight-line 3D grid drawings of graphs in linear volume
• Upward three-dimensional grid drawings of graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Stack and Queue Layouts of Directed Acyclic Graphs: Part I
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Stack and Queue Layouts of Posets
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
• The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Graph Drawing
• Layout of Graphs with Bounded Tree-Width
• Efficient Coroutine Generation of Constrained Gray Sequences