Planarity Testing and Optimal Edge Insertion with Embedding Constraints

DOI10.1007/978-3-540-70904-6_14zbMath1185.68482OpenAlexW2123605750MaRDI QIDQ3595460

Petra Mutzel, Karsten Klein, Carsten Gutwenger

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

Mathematics Subject Classification ID

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

Related Items (2)

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges ⋮ Practical Level Planarity Testing and Layout with Embedding Constraints

This page was built for publication: Planarity Testing and Optimal Edge Insertion with Embedding Constraints