Planarity Testing and Optimal Edge Insertion with Embedding Constraints

DOI10.1007/978-3-540-70904-6_14MaRDI QIDQ3595460zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Planar Graphs with Topological Constraints
• Inserting an edge into a geometric embedding
• scientific article; zbMATH DE number 1500680
• Inserting an edge into a planar graph

Cited in

(6)

• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Characterizing planar tanglegram layouts and applications to edge insertion problems
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
• Practical Level Planarity Testing and Layout with Embedding Constraints
• scientific article; zbMATH DE number 6863594 (Why is no real title available?)
• 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)