Optimal Orthogonal Graph Drawing with Convex Bend Costs

DOI10.1007/978-3-642-39206-1_16zbMath1336.68191OpenAlexW2397970461MaRDI QIDQ5326560

Dorothea Wagner, Ignaz Rutter, Thomas Bläsius

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_16

Mathematics Subject Classification ID

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

Related Items (3)

Planar Embeddings with Small and Uniform Faces ⋮ Orthogonal Graph Drawing with Inflexible Edges ⋮ Orthogonal graph drawing with inflexible edges

This page was built for publication: Optimal Orthogonal Graph Drawing with Convex Bend Costs