On the two-dimensional orthogonal drawing of series-parallel graphs

DOI10.1016/j.dam.2008.12.010zbMath1197.05100OpenAlexW2044188614MaRDI QIDQ1026151

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

zbMATH Keywords

series-parallel graph\(k\)-graphbend2-D orthogonal drawing

Mathematics Subject Classification ID

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)

Related Items (1)

Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs

Cites Work

• Embeddings of star graphs into optical meshes without bends
• A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
• A better heuristic for orthogonal graph drawings
• Drawing planar graphs using the canonical ordering
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Universality considerations in VLSI circuits
• The Recognition of Series Parallel Digraphs
• Spirality and Optimal Orthogonal Drawings
• Graph Drawing
• Algorithms and Computation

This page was built for publication: On the two-dimensional orthogonal drawing of series-parallel graphs