Skip to main content
SpringerLink
Log in

Crossing Numbers of Graphs with Rotation Systems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-known crossing number notions are NP-complete even if restricted to cubic graphs (with or without rotation system). In particular, we can show that Tutte’s independent odd crossing number is NP-complete, and we obtain a new and simpler proof of Hliněný’s result that computing the crossing number of a cubic graph is NP-complete.

We also consider the special case of multigraphs with rotation systems on a fixed number k of vertices. For k=1 we give an O(mlog m) algorithm, where m is the number of edges, and for loopless multigraphs on 2 vertices we present a linear time 2-approximation algorithm. In both cases there are interesting connections to edit-distance problems on (cyclic) strings. For larger k we show how to approximate the crossing number to within a factor of \({k+4\choose4}/5\) in time O(m klog m) on a graph with m edges.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Archdeacon, D.: Problems in topological graph theory. http://www.emba.uvm.edu/~archdeac/problems/npcubic.htm. Accessed 11 August 2008

  2. Bokal, D., Fijavž, G., Mohar, B.: Minor-monotone crossing number. In: Felsner, S. (ed.) EuroComb ’05. Discrete Mathematics and Theoretical Computer Science, vol. AE, pp. 123–128 (2005)

  3. Buchheim, C., Jünger, M., Menze, A., Percan, M.: Bimodal crossing minimization. In: Chen, D.Z., Lee, D.T. (eds.) COCOON. Lecture Notes in Computer Science, vol. 4112, pp. 497–506. Springer, Berlin (2006)

    Google Scholar 

  4. Diaconis, P., Graham, R.L.: Spearman’s footrule as a measure of disarray. J. R. Stat. Soc., Ser. B 39(2), 262–268 (1977)

    MATH  MathSciNet  Google Scholar 

  5. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237–267 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4(3), 312–316 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hliněný, P.: Crossing number is hard for cubic graphs. J. Combin. Theory, Ser. B 96(4), 455–471 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kedem, Z.M., Fuchs, H.: On finding several shortest paths in certain graphs. In: 18th Allerton Conference, pp. 677–686 (1980)

  9. Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1973)

    Google Scholar 

  10. Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. Assoc. Comput. Mach. 22, 177–183 (1975)

    MATH  MathSciNet  Google Scholar 

  11. Maes, M.: On a cyclic string-to-string correction problem. Inf. Process. Lett. 35(2), 73–78 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  12. Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: International Conference on Pattern Recognition, pp. 891–894 (2000)

  13. Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)

    MATH  Google Scholar 

  14. Pach, J., Tóth, G.: Which crossing number is it anyway? J. Combin. Theory, Ser. B 80(2), 225–246 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Removing even crossings. J. Combin. Theory, Ser. B 97(4), 489–500 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Crossing number of graphs with rotation systems. In: Graph Drawing (GD 2007) (2007)

  17. Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Removing even crossings on surfaces. In: Nešetřil, J., Márquez, A., Serra, O. (eds.) European Conference on Combinatorics, Graph Theory and Applications (EuroComb ’07). Electronic Notes in Discrete Mathematics, pp. 85–90. Elsevier, Amsterdam (2007)

    Google Scholar 

  18. Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Odd crossing number and crossing number are not the same. Discrete Comput. Geom. 39(1), 442–454 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pelsmajer, M.J., Schaefer, M., Štefankovič, D.: Removing independently even crossings. Graph Draw. (2009, to appear)

  20. Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365–380 (2003). Special issue on STOC2002 (Montreal, QC)

    Article  MATH  Google Scholar 

  21. Székely, L.A.: A successful concept for measuring non-planarity of graphs: the crossing number. Discrete Math. 276(1–3), 331–352 (2004). 6th International Conference on Graph Theory

    Article  MATH  MathSciNet  Google Scholar 

  22. Székely, L.A.: An optimality criterion for the crossing number. Ars Math. Contemp. 1(1), 32–37 (2008)

    MathSciNet  Google Scholar 

  23. Tao, T., Van, Vu.: Additive Combinatorics. Cambridge Studies in Advanced Mathematics, vol. 105. Cambridge University Press, Cambridge (2006)

    Book  MATH  Google Scholar 

  24. Tutte, W.T.: Toward a theory of crossing numbers. J. Combin. Theory 8, 45–53 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  25. Wagner, R.A.: On the complexity of the extended string-to-string correction problem. In: Seventh Annual ACM Symposium on Theory of Computing, Albuquerque, 1975, pp. 218–223. ACM, New York (1975)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL, 60616, USA

    Michael J. Pelsmajer

  2. Department of Computer Science, DePaul University, Chicago, IL, 60604, USA

    Marcus Schaefer

  3. Computer Science Department, University of Rochester, Rochester, NY, 14627-0226, USA

    Daniel Štefankovič

Authors
  1. Michael J. Pelsmajer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcus Schaefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Štefankovič
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcus Schaefer.

Additional information

M.J. Pelsmajer partially supported by NSA Grant H98230-08-1-0043.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pelsmajer, M.J., Schaefer, M. & Štefankovič, D. Crossing Numbers of Graphs with Rotation Systems. Algorithmica 60, 679–702 (2011). https://doi.org/10.1007/s00453-009-9343-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9343-y

Keywords

Search

Navigation