Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
From MaRDI portal
Publication:3648514
DOI10.1137/060667621zbMath1180.05076OpenAlexW2076823965MaRDI QIDQ3648514
Publication date: 27 November 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060667621
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (12)
Planar rectilinear drawings of outerplanar graphs in linear time ⋮ HV-planarity: algorithms and complexity ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ Unit-length rectangular drawings of graphs ⋮ Rectilinear planarity of partial 2-trees ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ Unnamed Item ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ NodeTrix planarity testing with small clusters ⋮ Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
This page was built for publication: Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends