Recent Advances in Exact Crossing Minimization (Extended Abstract)

We report on two related recent approaches for computing the crossing number of a graph. They have been quite successful for sparse graphs with up to 100 vertices. The algorithms are based on two integer linear programming formulations of the problem. These formulations can be simplified for complete graphs K n provided that a practical algorithm for solving the realizability problem can be found.