Heuristic crossing minimisation algorithms for the two-page drawing problem

The minimisation of edge crossings in a book drawing of a graph G is one of the important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several new heuristics for the two-page drawing problem, and test them on benchmark test suites, Rome graphs and Random Connected Graphs. We also test some typical graphs, and get some exact results. The results for some circulant graphs are better than the one presented by Cimikowski. We have a conjecture for cartesian graphs, supported by our experimental results, and provide direct methods to get optimal solutions for 3- or 4-row meshes and Halin graphs.

[1]  Wynand Winterbach.  The crossing number of a graph in the plane , 2005 .

[2]  Gérard Cornuéjols,et al.  Halin graphs and the travelling salesman problem , 1983, Math. Program..

[3]  The conjecture cr(Cm ×Cn) = (m – 2)n is true for all but finitely many n, for each m , 2000 .

[4]  Ulrik Brandes,et al.  Crossing Reduction in Circular Layouts , 2004, WG.

[5]  Farhad Shahrokhi,et al.  The book crossing number of a graph , 1996 .

[6]  Ioannis G. Tollis,et al.  Circular Drawings of Biconnected Graphs , 1999, ALENEX.

[7]  Yuansheng Yang,et al.  The Crossing Number of C(mk;{1, k}) , 2005, Graphs Comb..

[8]  Sumio Masuda,et al.  Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.

[9]  J. Pach.  Towards a Theory of Geometric Graphs , 2004 .

[10]  T.A.J. Nicholson.  Permutation procedure for minimising the number of crossings in a network , 1968 .

[11]  R. Bruce Richter,et al.  Arrangements, circular arrangements and the crossing number of C7X Cn , 2004, J. Comb. Theory B.

[12]  Ondrej Sýkora,et al.  Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs , 2005, SOFSEM.

[13]  Ralph Tindell,et al.  Circulants and their connectivities , 1984, J. Graph Theory.

[14]  Robert J. Cimikowski,et al.  Algorithms for the fixed linear crossing number problem , 2002, Discret. Appl. Math..

[15]  Farhad Shahrokhi,et al.  Intersection of Curves and Crossing Number of Cm× Cn on Surfaces , 1998, Discret. Comput. Geom..

[16]  Paul C. Kainen,et al.  The book thickness of a graph , 1979, J. Comb. Theory, Ser. B.

[17]  Hongmei He,et al.  New circular drawing algorithms , 2004 .

[18]  Erkki Mäkinen.  On circular layouts , 1988 .

[19]  Mihalis Yannakakis,et al.  Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.