Advertisement

Exact Crossing Number Parameterized by Vertex Cover

  • Petr HliněnýEmail author
  • Abhisekh Sankaran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11904)

Abstract

We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable advance since we know only very few nontrivial examples of graph classes with unbounded and yet efficiently computable crossing number. Our result can be viewed as a strengthening of a previous result of Lokshtanov [arXiv, 2015] that Optimal Linear Arrangement is in FPT when parameterized by the vertex cover size, and we use a similar approach of reducing the problem to a tractable instance of Integer Quadratic Programming as in Lokshtanov’s paper.

Keywords

Graph drawing Crossing number Parameterized complexity Vertex cover 

References

  1. 1.
    Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28(2), 300–343 (1984)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Biedl, T.C., Chimani, M., Derka, M., Mutzel, P.: Crossing number for graphs with bounded pathwidth. In: ISAAC 2017. LIPIcs, vol. 92, pp. 13:1–13:13. Schloss Dagstuhl (2017)Google Scholar
  3. 3.
    Cabello, S.: Hardness of approximation for crossing number. Discrete Comput. Geom. 49(2), 348–358 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cabello, S., Mohar, B.: Crossing and weighted crossing number of near-planar graphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 38–49. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-00219-9_5CrossRefGoogle Scholar
  5. 5.
    Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Chimani, M., Hliněný, P., Mutzel, P.: Vertex insertion approximates the crossing number for apex graphs. Eur. J. Comb. 33, 326–335 (2012)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Chimani, M., Hliněný, P.: A tighter insertion-based approximation of the crossing number. J. Comb. Optim. 33(4), 1183–1225 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Christian, R., Richter, R.B., Salazar, G.: Zarankiewicz’s conjecture is finite for each fixed m. J. Comb. Theory, Ser. B 103(2), 237–247 (2013)Google Scholar
  9. 9.
    Chuzhoy, J.: An algorithm for the graph crossing number problem. In: Proceedings of STOC 2011, pp. 303–312. ACM (2011)Google Scholar
  10. 10.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congr. Numer. 87, 161–178 (1992)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Even, G., Guha, S., Schieber, B.: Improved approximations of crossings in graph drawings and VLSI layout areas. SIAM J. Comput. 32(1), 231–252 (2002)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Fox, J., Pach, J., Suk, A.: Approximating the rectilinear crossing number. Comput. Geom. 81, 45–53 (2019)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Fulek, R., Tóth, C.D.: Crossing minimization in perturbed drawings. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 229–241. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-04414-5_16CrossRefGoogle Scholar
  14. 14.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Discr. Meth. 4, 312–316 (1983)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Gitler, I., Hliněný, P., Leanos, J., Salazar, G.: The crossing number of a projective graph is quadratic in the face-width. Electron. Notes Discrete Math. 29, 219–223 (2007)CrossRefGoogle Scholar
  16. 16.
    Grohe, M.: Computing crossing numbers in quadratic time. J. Comput. Syst. Sci. 68(2), 285–302 (2004)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Hliněný, P., Chimani, M.: Approximating the crossing number of graphs embeddable in any orientable surface. In: Proceedings of SODA 2010, pp. 918–927. ACM (2010)Google Scholar
  18. 18.
    Hliněný, P., Salazar, G.: On the crossing number of almost planar graphs. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 162–173. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-70904-6_17CrossRefGoogle Scholar
  19. 19.
    Kawarabayashi, K., Reed, B.A.: Computing crossing number in linear time. In: Proceedings of STOC 2007, pp. 382–390. ACM (2007)Google Scholar
  20. 20.
    Lokshtanov, D.: Parameterized integer quadratic programming: Variables and coefficients. CoRR abs/1511.00310 (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Informatics of Masaryk UniversityBrnoCzech Republic
  2. 2.Department of Computer Science and TechnologyUniversity of CambridgeCambridgeUK

Personalised recommendations