Using Sifting for k-Layer Straightline Crossing Minimization
We present a new algorithm for k-layer straightline crossing minimization which is based on sifting that is a heuristic for dynamic reordering of decision diagrams used during logic synthesis and formal verification of logic circuits. The experiments prove sifting to be very efficient. In particular it outperforms the traditional layer by layer sweep based heuristics known from literature by far when applied to k-layered graphs with k ≥ 3.
- JM97.M. Jünger and P. Mutzel. 2-Layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1(1):1–25, 1997.Google Scholar
- Knu93.D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA, 1993.Google Scholar
- MGB+98.P. Mutzel, C. Gutwenger, R. Brockenauer, S. Fialko, G. W. Klau, M. Krüger, T. Ziegler, S. Näher, D. Alberts, D. Ambras, G. Koch, M. Jünger, C. Buchheim, and S. Leipert. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD’ 98), volume 1547 of Lecture Notes in Computer Science, pages 456–457. Springer, 1998. Project home page at http://www.mpi-sb.mpg.de/AGD/.Google Scholar
- MN99.K. Mehlhorn and S. Näher. The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http://www.mpi-sb.mpg.de/LEDA/.
- Rud93.R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conf. on Computer-Aided Design (ICCAD), pages 42–47, November 1993.Google Scholar