Exact Crossing Minimization
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.
- 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
- 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
- 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
- 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.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