A New Approximation Algorithm for Bend Minimization in the Kandinsky Model

DOI10.1007/978-3-540-70904-6_33zbMATH Open1185.68846OpenAlexW1548674621MaRDI QIDQ3595481FDOQ3595481

Canan Yıldız, Petra Mutzel, W. Barth

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_33

Recommendations

• Complexity of higher-degree orthogonal graph embedding in the Kandinsky model
• On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
• On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
• Orthogonal drawings based on the stratification of planar graphs
• SOFSEM 2005: Theory and Practice of Computer Science

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (5)

• Planar L-Drawings of Bimodal Graphs
• Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
• Planar confluent orthogonal drawings of 4-modal digraphs
• Planar L-Drawings of Directed Graphs
• Planar L-Drawings of Bimodal Graphs

This page was built for publication: A New Approximation Algorithm for Bend Minimization in the Kandinsky Model

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