Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Theoretical Computer Science
Who are the variables in your neighborhood
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Arc crossing minimization in hierarchical digraphs with tabu search
Computers and Operations Research
Using lower bounds during dynamic BDD minimization
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
A Library of Algorithms for Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Crossing Reduction by Windows Optimization
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
| Hi-index | 0.00 |
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.