Crossing reduction by windows optimization

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

Volumn 2528 LNCS, Issue , 2002, Pages 285-294

  Eschbach, Thomas ^a   Günther, Wolfgang ^b   Drechsler, Rolf ^c   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

^b INFINEON TECHNOLOGIES AG   (Germany)

^c UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DRAWING (GRAPHICS); INTEGRATED CIRCUIT MANUFACTURE; RECONFIGURABLE HARDWARE;

CIRCUIT DESIGNS; EDGE CROSSING; GRAPH DRAWING; HIGH QUALITY; LINE CROSSINGS; LOCAL OPTIMIZATIONS; WINDOWS OPTIMIZATIONS; POST PROCESSING;

OPTIMIZATION;

EID: 84867472695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_27     Document Type: Conference Paper

References (21)

1. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for Drawing Graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282, 1994.
2. F. Brglez, D. Bryan, and K. Kozminski. Combinational Profiles of Sequential Benchmark Circuits. Int'l Symp. Circ. and Systems, 1924-1934, 1989.
3. R. Drechsler, W. Günther, L. Linhard, and G. Angst. Level Assignment for Displaying Combinational Logic. In EUROMICRO, 148-151, 2001.
4. P. Eades, and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21.A:89-98, 1986.
5. P. Eades, and K. Sugiyama. How to draw a Directed Graph. Journal of Information Processing, Vol.13, 4, 424-437, 1991.
6. M. Fujita, Y. Matsunaga, and T. Kakuda. On Variable Ordering of Binary Decision Diagrams for the Application of Multi-Level Synthesis. European Conf. on Design Automation, 50-54, 1991.
7. M. R. Garey, and D.S. Johnson. Crossing number is NP-Complete. SIAM Journal on Algebraic and Discrete Methods, 4:312-316, 1983.
8. W. Günther, R. Schönfeld, B. Becker, and P. Molitor. K-Layer Straightline Crossing Minimization by Speeding up Sifting. Proceedings of the 8th International Symposium on Graph Drawing, 253-258, 2000.
9. N. Ishiura, H. Sawada, and S. Yajima. Minimization of Binary Decision Diagrams Based on Exchange of Variables. Int'l Conf. on CAD, 472-475, 1991.
10. M. Jünger, E.K. Lee, P. Mutzel, and T. Odenthal. A Polyhedral Approach to the Multi-Layer Crossing Number Problem. Proceedings of the 5th International Symposium on Graph Drawing, LNCS Vol. 1353, 13-24, 1997.
11. M. Jünger and P. Mutzel. 2-Layer Straightline Crosing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Agorithms Appl., 1(1):1-25, 1997.
12. M. Laguna, R. Martí, and V. Valls. Arc Crossing Minimization in Hierarchical Digraphs with Tabu Search. Computers and Operations Research, Vol. 24, 2:1175-1186, 1997.
13. E. Mäkinen. Experiments on drawing 2-level hierarchical graphs. International Journal of Computer and Mathematics, 36:175-181, 1990.
14. E. Mäkinen. How to draw a hypergraph. International Journal of Computer and Mathematics, 34:177-185, 1990.
15. C. Matuszewski, R. Schönfeld, and P. Molitor. Using Sifting for k-Layer straightline crossing minimization. Proceedings of the 7th International Symposium on Graph Drawing, LNCS 1731, 217-224, 1999.
16. K. McElvain Benchmark Set: Version 4.0. International Workshop on Logic Synthesis, 1993.
17. K. Mehlhorn, and S. Näher. LEAD: A Platform for Combinatorial and Geometric Computing. Communications of the ACM, 38, 1:96-102, 1995.
18. P. Mutzel. An Alternative Method for Crossing Minimization on Hierarchical Graphs. SIAMJournal on Optimization, 11, 4, 1065-1080, 2001.
19. 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. AGD: A Library of Algorithms for Graph Drawing. Proceedings of the 6th International Symposium on Graph Drawing, LNCS 1547, 456-457, 1998.
20. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man and Cybernetics, 11(2): 109-125, 1981.
21. J. Warfield. Crossing Theory and Hierarchy Mapping. IEEE Transactions on System, Man, and Cybernetics, SMC-7, 7, 502-523, 1977.