Advances in the Planarization Method: Effective Multiple Edge Insertions

DOI10.1007/978-3-642-25878-7_10zbMath1311.68108OpenAlexW2132134303MaRDI QIDQ5895513

Markus Chimani, Carsten Gutwenger

Publication date: 9 March 2012

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25878-7_10

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) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex insertion approximates the crossing number of apex graphs
• Inserting an edge into a planar graph
• A tighter insertion-based approximation of the crossing number
• An experimental comparison of four graph drawing algorithms.
• A New Approach to Exact Crossing Minimization
• On the Crossing Number of Almost Planar Graphs
• Crossing and Weighted Crossing Number of Near-Planar Graphs
• On-Line Planarity Testing
• Dividing a Graph into Triconnected Components
• Graph Drawing

This page was built for publication: Advances in the Planarization Method: Effective Multiple Edge Insertions