HE, SÝKORA and VRT'O, 2005. Crossing minimisation heuristics for 2-page drawings. Electronic notes in discrete mathematics, 22, pp. 527-534
The minimisation of edge crossings in a book drawing of a graph G is one of 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 2-page drawing problem and test them on benchmark test
sets like Rome graphs, Random Connected Graphs and some typical graphs. We
get exact results of some structural graphs, and compare some of the experimental
results with the one in paper.