k-Layer Straightline Crossing Minimization by Speeding Up Sifting

Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 253-258(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_24).

Full text not available from this repository.

Abstract

Recently, a technique called sifting has been proposed for k-layer straightline crossing minimization. This approach outperforms the traditional layer by layer sweep based heuristics by far when applied to k-layered graphs with $k\geq 3$. In this paper, we present two methods to speed up sifting. First, it is shown how the crossing matrix can be computed and updated efficiently. Then, we study lower bounds which can be incorporated in the sifting algorithm, allowing to prune large parts of the search space. Experimental results show that it is possible to speed up sifting by more than a factor of 20 using the new methods.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_24
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.700 Layering
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/388

Actions (login required)

View Item View Item