On the two-dimensional orthogonal drawing of series-parallel graphs
From MaRDI portal
(Redirected from Publication:1026151)
Recommendations
Cites work
- A better heuristic for orthogonal graph drawings
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Algorithms and Computation
- Drawing planar graphs using the canonical ordering
- Embeddings of star graphs into optical meshes without bends
- Graph Drawing
- On the computational complexity of upward and rectilinear planarity testing
- Spirality and Optimal Orthogonal Drawings
- The Recognition of Series Parallel Digraphs
- Universality considerations in VLSI circuits
Cited in
(5)- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- Linkless symmetric drawings of series parallel digraphs
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Graph Drawing
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
This page was built for publication: On the two-dimensional orthogonal drawing of series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026151)