Simultaneous Embedding with Two Bends per Edge in Polynomial Area

DOI10.1007/11785293_25zbMath1142.05367OpenAlexW1575929063MaRDI QIDQ5757908

Frank Kammer

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Simultaneous Embeddings with Few Bends and Crossings ⋮ Relaxing the constraints of clustered planarity ⋮ Beyond Clustered Planar Graphs

This page was built for publication: Simultaneous Embedding with Two Bends per Edge in Polynomial Area