scientific article; zbMATH DE number 6297757
From MaRDI portal
Publication:5417677
zbMath1288.68268MaRDI QIDQ5417677
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (10)
Inserting Multiple Edges into a Planar Graph ⋮ Exact crossing number parameterized by vertex cover ⋮ Crossing numbers and stress of random graphs ⋮ Vertex insertion approximates the crossing number of apex graphs ⋮ Crossing number for graphs with bounded pathwidth ⋮ A tighter insertion-based approximation of the crossing number ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Crossing numbers of beyond-planar graphs ⋮ Crossing numbers of beyond-planar graphs ⋮ Unnamed Item
This page was built for publication:
