Planarity Testing and Optimal Edge Insertion with Embedding Constraints
DOI10.1007/978-3-540-70904-6_14zbMATH Open1185.68482OpenAlexW2123605750MaRDI QIDQ3595460FDOQ3595460
Authors: Carsten Gutwenger, Karsten Klein, Petra Mutzel
Publication date: 28 August 2007
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_14
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (7)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Title not available (Why is that?)
- Characterizing planar tanglegram layouts and applications to edge insertion problems
- Simultaneous FPQ-ordering and hybrid planarity testing
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Planar Graphs with Topological Constraints
This page was built for publication: Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595460)