Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897850zbMATH OpenOpenAlexFDO

Authors Xiao Zhou, Takao Nishizeki

Publication date 14 November 2006

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

Full work available at URL https://doi.org/10.1007/11602613

zbMATH Keywords

planar graphseries-parallel graphorthogonal drawingbend

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• Graph Drawing
• scientific article; zbMATH DE number 1953108
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
• Bend-optimal orthogonal drawings of triconnected plane graphs

Cited in

(8)

• Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
• Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
• Optimal Orthogonal Graph Drawing with Convex Bend Costs
• Graph Drawing
• Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
• On the two-dimensional orthogonal drawing of series-parallel graphs
• Linkless symmetric drawings of series parallel digraphs
• Relating bends and size in orthogonal graph drawings

This page was built for publication: Algorithms and Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897850)