Optimal compaction of orthogonal grid drawings (Extended Abstract)

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

Volumn 1610, Issue , 1999, Pages 304-319

  Klau, Gunnar W ^a   Mutzel, Petra ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPACTION; GRAPHIC METHODS; INTEGRATED CIRCUIT DESIGN; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; VLSI CIRCUITS;

COMPUTATIONAL EXPERIMENT; CONSTRAINT GRAPH; EXTENDED ABSTRACTS; FEASIBLE SOLUTION; GEOMETRICAL PROBLEMS; INTEGER LINEAR PROGRAMS; ORTHOGONAL GRID DRAWINGS; POLYNOMIAL-TIME;

INTEGER PROGRAMMING;

EID: 84926278548     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_23     Document Type: Conference Paper

References (16)

1. AGD. AGD User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Umversität Köln, 1998. http://www.mpi-sb.mpg.de/AGD.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
3. D. Alberts, C. Gutwenger, P. Mutzel, and S. Näher. AGD-Library: A library of algorithms for graph drawing. In G. Italiano and S. Orlando, editors, WAE ’97 (Proc. on the Workshop on Algorithm. Engineering), Venice, Italy, Sept. 11-13, 1997. http://www.dsi.unive.it/~wae97.
4. G. D. Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. CGTA: Computational Geometry: Theory and Applications, 7:303 - 316, 1997.
5. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings of orthogonal representations. Technical report, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, 1999. To appear.
6. U. Föβmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes in Computer Science, pages 254-266. Springer-Verlag, 1996.
7. M. Jünger and S. Thienel. Introduction to ABACUS - A Branch-And-CUt System. Operations Research Letters, 22:83-95, March 1998.
8. G. Kedem and H. Watanabe. Graph optimization techniques for IC-layout and compaction. IEEE Transact. Comp.-Aided Design of Integrated Circuits and Systems, CAD-3 (1): 12-20, 1984.
9. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. Technical Report MPI-I-98-1-031, Max-Planck-Institut für Informatik, Saarbrücken, December 1998.
10. G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, May 1998.
11. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.
12. K. Mehlhorn, S. Näher, M. Seel, and C. Uhrig. LEDA Manual Version 3.7.1. Technical report, Max-Planck-Institut für Informatik, 1998. http://www.mpi-sb.mpg.de/LEDA.
13. K. Mehlhorn and S. Näher. LEDA: A platform for combinatorial and geometric computing. Communications of the ACM, 38(1):96-102, 1995.
14. M. Patrignani. On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, January 1999.
15. M. Schlag, Y.-Z. Liao, and C. K. Wong. An algorithm for optimal two-dimensional compaction of VLSI layouts. Integration, the VLSI Journal, 1:179-209, 1983.
16. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.