Sergio Cabello
ABSTRACT
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea in the reduction is to consider the problem of simultaneously drawing two planar graphs inside a disk, with some of its vertices fixed at the boundary of the disk. This approach can be used to prove hardness of some other geometric problems. As an interesting consequence we obtain a new, geometric proof of NP-completeness of the crossing number problem, even when restricted to cubic graphs. This resolves a question of Hlinený.
- K. J. Borozky, J. Pach, and G. Toth. Planar crossing numbers of graphs embeddable in another surface. Int. J. Found. Comput. Sci., 17(5):1005--1016, 2006.Google Scholar
Cross Ref
- S. Cabello and B. Mohar. Crossing and weighted crossing number of near-planar graphs. Algorithmica, accepted. Available at http://dx.doi.org/10.1007/s00453-009-9357-5. Preliminary version in Graph Drawing 2008. Google ScholarDigital Library
- M. Chimani and P. Hlinený. Approximating the crossing number of graphs embeddable in any orientable surface. In Proc. SODA 2010, to appear. Google ScholarDigital Library
- M. Chimani, P. Hlinený, and P. Mutzel. Vertex insertion approximates the crossing number for apex graphs. Manuscript available at http://www.fi.muni.cz/~hlineny/Research/papers/. Preliminary version in Graph Drawing 2008.Google Scholar
- H. Djidjev and I. Vrto. Planar crossing numbers of genus g graphs. In ICALP 2006, volume 4051 of LNCS, pages 419--430, 2006. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM J. Alg. Discr. Meth., 4:312--316, 1983.Google ScholarDigital Library
- M. Grohe. Computing crossing numbers in quadratic time. In Proc. STOC 2001, pages 231--236, 2001. Google ScholarDigital Library
- C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. Algorithmica, 41:289--308, 2005.Google ScholarCross Ref
- P. Hlinený. Crossing number is hard for cubic graphs. J. Comb. Theory, Ser. B, 96(4):455--471, 2006. Google ScholarDigital Library
- P. Hlinený and G. Salazar. On the crossing number of almost planar graphs. In M. Kaufmann and D. Wagner, editors, GD 2006, volume 4372 of LNCS, pages 162--173. Springer, 2007. Google ScholarDigital Library
- P. Hlinený and G. Salazar. Approximating the crossing number of toroidal graphs. In T. Tokuyama, editor, ISAAC 2007, volume 4835 of LNCS, pages 148--159, 2007. Google ScholarDigital Library
- K.-I. Kawarabayashi and B. Reed. Computing crossing number in linear time. In Proc. STOC 2007, pages 382--390, 2007. Google ScholarDigital Library
- B. Mohar. On the crossing number of almost planar graphs. Informatica, 30:301--303, 2006.Google Scholar
- M. J. Pelsmajer, M. Schaefer, and D. Štefankovic. Crossing number of graphs with rotation systems. Algorithmica, accepted. Available at http://dx.doi.org/10.1007/s00453-009-9343-y.Google Scholar
- A. Riskin. The crossing number of a cubic plane polyhedral map plus an edge. Studia Sci. Math. Hungar., 31:405--413, 1996.Google Scholar
- S. Werner. On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary. Combinatorica, 29(1):121--126, 2009. Google ScholarDigital Library
Index Terms
- Adding one edge to planar graphs makes crossing number hard
Recommendations
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every edge is crossed by ...
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, ź(n2) is the established upper and lower bound on the worst-case area. A long-standing open problem is to determine for what graphs a smaller area can be ...
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
Two cycles are said to be adjacent if they share a common edge. Let G be a planar graph without triangles adjacent 4-cycles. We prove that l ( G ) Δ ( G ) + 2 if Δ ( G ) 6 , and l ' ( G ) = Δ ( G ) and l ( G ) = Δ ( G ) + 1 if Δ ( G ) 8 , where l ' ( G )...
Comments