Orthogonal-Ordering Constraints are Tough

DOI10.7155/jgaa.00281zbMath1256.05156OpenAlexW2161556229MaRDI QIDQ4899120

Barbara Pampel, Ulrik Brandes

Publication date: 7 January 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00281

zbMATH Keywords

rectilinear graph drawingbend-minimum orthogonal graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

On the Approximability of Orthogonal Order Preserving Layout Adjustment

This page was built for publication: Orthogonal-Ordering Constraints are Tough