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 ≥ 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.
CITATION STYLE
Günther, W., Schönfeld, R., Becker, B., & Molitor, P. (2001). k-layer straightline crossing minimization by speeding up sifting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 253–258). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_24
Mendeley helps you to discover research relevant for your work.