Simultaneous Embedding with Two Bends per Edge in Polynomial Area

DOI10.1007/11785293_25MaRDI QIDQ5757908zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(11)

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

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)