Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)

DOI10.1007/3-540-57155-8_244zbMath1504.68161OpenAlexW1536741012MaRDI QIDQ5060109

Francesco Vargiu, Giuseppe Liotta, Giuseppe Di Battista

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_244

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Computing orthogonal drawings with the minimum number of bends ⋮ Algorithms for area-efficient orthogonal drawing ⋮ An efficient orthogonal grid drawing algorithm for cubic graphs ⋮ On-line convex planarity testing

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms for plane representations of acyclic digraphs
• Planar graphs: Theory and algorithms
• On minimal-node-cost planar embeddings
• On Embedding a Graph in the Grid with the Minimum Number of Bends

This page was built for publication: Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)