scientific article
From MaRDI portal
Publication:3132864
DOI10.4230/LIPIcs.SoCG.2016.30zbMath1388.68216arXiv1509.07952MaRDI QIDQ3132864
Publication date: 30 January 2018
Full work available at URL: https://arxiv.org/abs/1509.07952
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)
Related Items (14)
Parameterized analysis and crossing minimization problems ⋮ Extension of some edge graph problems: standard, parameterized and approximation complexity ⋮ A Note on the Practicality of Maximal Planar Subgraph Algorithms ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Unnamed Item ⋮ Crossing numbers and stress of random graphs ⋮ Crossing number for graphs with bounded pathwidth ⋮ Unnamed Item ⋮ A tighter insertion-based approximation of the crossing number ⋮ Inserting an edge into a geometric embedding ⋮ Inserting an edge into a geometric embedding ⋮ Inserting one edge into a simple drawing is hard ⋮ Unnamed Item ⋮ 1-planarity testing and embedding: an experimental study
This page was built for publication:
