Crossing Number and Weighted Crossing Number of Near-Planar Graphs

Authors:
Sergio Cabello;Bojan Mohar
Affiliations:
FMF, University of Ljubljana, Department of Mathematics, Ljubljana, Slovenia;Simon Fraser University, Department of Mathematics, V5A 1S6, Burnaby, BC, Canada
Venue:
Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry
Year:
2011

Citing 0
Cited 3

Adding one edge to planar graphs makes crossing number hard

Proceedings of the twenty-sixth annual symposium on Computational geometry
Vertex insertion approximates the crossing number of apex graphs

European Journal of Combinatorics
Untangling graphs representing spatial relationships driven by drawing aesthetics

Proceedings of the 17th Panhellenic Conference on Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds. These min-max results are the first of their kind in the study of crossing numbers and improve the approximation factor for the approximation algorithm given by Hliněný and Salazar (Graph Drawing GD’06). On the other hand, we show that it is NP-hard to compute a weighted version of the crossing number for near-planar graphs.