HOW TO DRAW A SERIES-PARALLEL DIGRAPH
From MaRDI portal
Recommendations
Cited in
(18)- Algorithms for plane representations of acyclic digraphs
- Advances in the theory and practice of graph drawing
- New results on drawing angle graphs
- Drawing series parallel digraphs symmetrically
- Linkless symmetric drawings of series parallel digraphs
- Upward planarity testing
- Chronological rectangle digraphs which are two-terminal series-parallel
- scientific article; zbMATH DE number 1693469 (Why is no real title available?)
- Miscellaneous digraph classes
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS
- scientific article; zbMATH DE number 4062623 (Why is no real title available?)
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- How to draw a series-parallel digraph
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- Upward planar morphs
- Upward planar morphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- On planar straight-line dominance drawings
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 Q4327386)