Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time

DOI10.1007/s00453-023-01110-6arXiv2205.07500OpenAlexW4323925872MaRDI QIDQ6053468

Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali

Publication date: 27 September 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.07500

zbMATH Keywords

series-parallel graphslinear-time algorithmsplane graphsbend minimizationorthogonal drawings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items

Rectilinear Planarity of Partial 2-Trees ⋮ An annotated review on graph drawing and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs: Theory and algorithms
• HV-planarity: algorithms and complexity
• Orthogonal planarity testing of bounded treewidth graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• The Recognition of Series Parallel Digraphs
• Linear-time computability of combinatorial problems on series-parallel graphs
• Spirality and Optimal Orthogonal Drawings
• A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
• Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Accelerated Bend Minimization
• Graph Drawing

This page was built for publication: Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time