Exact Crossing Minimization

  • Christoph Buchheim
  • Dietmar Ebner
  • Michael Jünger
  • Gunnar W. Klau
  • Petra Mutzel
  • René Weiskircher
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3843)

Abstract

The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph into the plane. This very basic property has been studied extensively in the literature from a theoretic point of view and many bounds exist for a variety of graph classes. In this paper, we present the first algorithm able to compute the crossing number of general sparse graphs of moderate size and present computational results on a popular benchmark set of graphs. The approach uses a new integer linear programming formulation of the problem combined with strong heuristics and problem reduction techniques. This enables us to compute the crossing number for 91 percent of all graphs on up to 40 nodes in the benchmark set within a time limit of five minutes per graph.

References

  1. 1.
    Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity-relationship diagrams. Journal of Systems and Software 4, 163–173 (1984)CrossRefGoogle Scholar
  2. 2.
    Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences 28, 300–343 (1984)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bodlaender, H., Grigoriev, A.: Algorithms for graphs embeddable with few crossings per edge. Research Memoranda 036, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization (2004)Google Scholar
  4. 4.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13(3), 335–379 (1976)MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications 7(5-6), 303–325 (1997)MATHMathSciNetGoogle Scholar
  6. 6.
    Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods 4, 312–316 (1983)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Grohe, M.: Computing crossing numbers in quadratic time. In: STOC 2001: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001)Google Scholar
  9. 9.
    Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13–24. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Guy, R.K.: Crossing numbers of graphs. In: Graph Theory and Applications (Proceedings). Lecture Notes in Mathematics, pp. 111–124. Springer, Heidelberg (1972)Google Scholar
  11. 11.
    Hopcroft, J., Tarjan, R.: Efficient planarity testing. Journal of the ACM 21(4), 549–568 (1974)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Jünger, M., Mutzel, P.: Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16(1), 33–59 (1996)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kratochvíl, J.: String graphs. II.: Recognizing string graphs is NP-hard. Journal of Combinatorial Theory, Series B 52(1), 67–78 (1991)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Liu, P., Geldmacher, R.: On the deletion of nonplanar edges of a graph. In: Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, pp. 727–738 (1977)Google Scholar
  15. 15.
    Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the NP-completeness of a computer network layout problem. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 292–295 (1987)Google Scholar
  16. 16.
    Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Transactions on Computers 39(1), 124–127 (1990)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427–439 (1997)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  19. 19.
    Turán, P.: A note of welcome. Journal of Graph Theory 1, 7–9 (1977)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christoph Buchheim
    • 1
  • Dietmar Ebner
    • 2
  • Michael Jünger
    • 1
  • Gunnar W. Klau
    • 3
  • Petra Mutzel
    • 4
  • René Weiskircher
    • 5
  1. 1.Department of Computer ScienceUniversity of Cologne 
  2. 2.Institute of Computer Graphics and AlgorithmsVienna University of Technology 
  3. 3.Department of Mathematics and Computer ScienceFU Berlin 
  4. 4.Department of Computer ScienceUniversity of Dortmund 
  5. 5.CSIRO Mathematical and Information Sciences 

Personalised recommendations