k-layer straightline crossing minimization by speeding up sifting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 253-258

  Günther, Wolfgang ^a   Schönfeld, Robby ^b   Becker, Bernd ^a   Molitor, Paul ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CROSSING MINIMIZATION; LAYER BY LAYER; LAYERED GRAPHS; LOWER BOUNDS; SEARCH SPACES; SIFTING ALGORITHM; SPEED UP;

DRAWING (GRAPHICS);

EID: 84958544869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_24     Document Type: Conference Paper

References (10)

1. R.E. Bryant. Graph - based algorithms for Boolean function manipulation. IEEE Trans. on Comp., 35(8):677-691, 1986.
2. R. Drechsler and W. Günther. Using lower bounds during dynamic BDD minimization. In Design Automation Conf., pages 29-32, 1999.
3. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361-374, 1994.
4. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1(1):1-25, 1997.
5. M. Laguna, R. Martí and V. Valls. Arc crossing minimization in hierarchical digraphs with tabu search. Computers and Operations Research, 24(12):1175-1186, 1997.
6. C. Matuszewski, R. Schönfeld, and P. Molitor. Using sifting for k-layer straightline crossing minimization. In Graph Drawing Conference, LNCS 1731, pages 217-224, 1999.
7. 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/.
8. P. Mutzel, 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 International Symposium on Graph Drawing, LNCS 1547, pages 456-457, 1998. Project home page at http://www.mpi-sb.mpg.de/AGD/.
9. S. Panda and F. Somenzi. Who are the variables in your neighborhood. In Int'l Conf. on CAD, pages 74-77, 1995.
10. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Int'l Conf. on CAD, pages 42-47, 1993.