Planar L-Drawings of Directed Graphs
Publication:4625136
DOI10.1007/978-3-319-73915-1_36zbMath1503.68212arXiv1708.09107OpenAlexW2963534320MaRDI QIDQ4625136
Sabine Cornelsen, Maurizio Patrignani, Steven Chaplick, Markus Chimani, Alexander Wolff, Giordano Da Lozzo, Martin Nöllenburg, Ioannis. G. Tollis
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.09107
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Algorithms for plane representations of acyclic digraphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- L-Drawings of Directed Graphs
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
- Bitonic st-orderings of Biconnected Planar Graphs
- On the Complexity of HV-rectilinear Planarity Testing
- Bitonic st-orderings for Upward Planar Graphs
- Overloaded Orthogonal Drawings
- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
- Planar L-Drawings of Directed Graphs
- On-Line Planarity Testing