scientific article; zbMATH DE number 7051205
From MaRDI portal
Publication:4633846
zbMath1421.68111MaRDI QIDQ4633846
Christian Wolf, Markus Chimani, Petra Mutzel, Carsten Gutwenger
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496812
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (12)
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics ⋮ Star-struck by fixed embeddings: modern crossing number heuristics ⋮ Inserting Multiple Edges into a Planar Graph ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Unnamed Item ⋮ Vertex insertion approximates the crossing number of apex graphs ⋮ A tighter insertion-based approximation of the crossing number ⋮ Inserting an edge into a geometric embedding ⋮ Inserting an edge into a geometric embedding ⋮ Approximating the Crossing Number of Apex Graphs ⋮ Inserting one edge into a simple drawing is hard ⋮ An effective crossing minimisation heuristic based on star insertion
This page was built for publication:
