How to draw a series-parallel digraph
DOI10.1007/3-540-55706-7_23zbMATH Open1502.68208OpenAlexW1565145555MaRDI QIDQ5056147FDOQ5056147
Authors: P. Bertolazzi, R. F. Cohen, Giuseppe Di Battista, Roberto Tamassia, 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- The Recognition of Series Parallel Digraphs
- A unified approach to visibility representations of planar graphs
- Area requirement and symmetry display of planar upward drawings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bipartite graphs, upward drawings, and planarity
- Algorithms for plane representations of acyclic digraphs
- Planar graphs: Theory and algorithms
- Title not available (Why is that?)
- Planar acyclic oriented graphs
- Title not available (Why is that?)
- How to draw a series-parallel digraph
Cited In (7)
- A more compact visibility representation
- Cross-series-parallel digraphs
- How to draw a series-parallel digraph
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Title not available (Why is that?)
- Algorithms for plane representations of acyclic digraphs
- Chronological rectangle digraphs which are two-terminal series-parallel
This page was built for publication: How to draw a series-parallel digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056147)
