On the two-dimensional orthogonal drawing of series-parallel graphs
DOI10.1016/J.DAM.2008.12.010zbMATH Open1197.05100OpenAlexW2044188614MaRDI QIDQ1026151FDOQ1026151
Authors: Satoshi Tayu, Kumiko Nomura, Shuichi Ueno 
Publication date: 24 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.010
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- The Recognition of Series Parallel Digraphs
- A better heuristic for orthogonal graph drawings
- Drawing planar graphs using the canonical ordering
- Algorithms and Computation
- On the computational complexity of upward and rectilinear planarity testing
- Universality considerations in VLSI circuits
- Embeddings of star graphs into optical meshes without bends
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Spirality and Optimal Orthogonal Drawings
- Graph Drawing
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)
