Using sifting for k-layer straightline crossing minimization

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

Volumn 1731, Issue , 1999, Pages 217-224

  Matuszewski, Christian ^a   Schönfeld, Robby ^a   Molitor, Paul ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS); LOGIC SYNTHESIS;

CROSSING MINIMIZATION; DECISION DIAGRAM; DYNAMIC REORDERING; LAYER BY LAYER; LAYERED GRAPHS;

COMPUTER CIRCUITS;

EID: 84958986374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_22     Document Type: Conference Paper

References (11)

1. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89-98, 1986.
2. P. Eades and S. Whitesides. Drawing graphs in two layers. Theoretical Computer Science, 131:361-374, 1994.
3. P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379-403, 1994.
4. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4:312-316, 1983.
5. 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.
6. D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA, 1993.
7. E. Mäkinen. Experiments on drawing 2-level hierarchical graphs. Internat. J. Comput. Math., 36:175-181, 1990.
8. 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/.
9. 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/.
10. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conf. on Computer-Aided Design (ICCAD), pages 42-47, November 1993.
11. 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.