How to draw a series-parallel digraph
From MaRDI portal
Publication:5056147
DOI10.1007/3-540-55706-7_23zbMath1502.68208OpenAlexW1565145555MaRDI QIDQ5056147
Giuseppe Di Battista, Roberto Tamassia, Paola Bertolazzi, R. F. Cohen, Ioannis. G. Tollis
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_23
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Bipartite graphs, upward drawings, and planarity
- A unified approach to visibility representations of planar graphs
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- Planar graphs: Theory and algorithms
- Planar acyclic oriented graphs
- The Recognition of Series Parallel Digraphs
- How to draw a series-parallel digraph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item