Simultaneous Embedding with Two Bends per Edge in Polynomial Area

DOI10.1007/11785293_25zbMATH Open1142.05367OpenAlexW1575929063MaRDI QIDQ5757908FDOQ5757908

Authors: 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

Recommendations

• Graph Drawing
• Simultaneous Embedding of Planar Graphs with Few Bends
• On simultaneous planar graph embeddings
• Algorithms and Data Structures
• Simultaneous graph embedding with bends and circular arcs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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)

Cited In (11)

• Simultaneous graph embedding with bends and circular arcs
• Two maps on one surface
• Drawing partially embedded and simultaneously planar graphs
• Graph Drawing
• Simultaneous embeddings with vertices mapping to pre-specified points
• Relaxing the constraints of clustered planarity
• Simultaneous Graph Embedding with Bends and Circular Arcs
• Beyond Clustered Planar Graphs
• Simultaneous embeddings with few bends and crossings
• Drawing partially embedded and simultaneously planar graphs
• Simultaneous embeddings with few bends and crossings

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

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