Using Sifting for k-Layer Straightline Crossing Minimization

Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 217-224 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_22).

Full text not available from this repository.

Abstract

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 \ge 3.

Item Type:Conference Paper
Additional Information:10.1007/3-540-46648-7_22
Classifications:G Algorithms and Complexity > G.700 Layering
P Styles > P.720 Straight-line
G Algorithms and Complexity > G.420 Crossings
ID Code:330

Repository Staff Only: item control page

References

P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89-98, 1986.

P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361-374, 1994.

P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379-403, 1994.

M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4:312-316, 1983.

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.

D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA, 1993.

E. Mäkinen. Experiments on drawing 2-level hierarchical graphs. Internat. J. Comput. Math., 36:175-181, 1990.

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/.

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/.

R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conf. on Computer-Aided Design (ICCAD), pages 42-47, November 1993.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109-125, February 1981.