Combining graph labeling and compaction

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

Volumn 1731, Issue , 1999, Pages 27-37

  Klau, Gunnar W ^a   Mutzel, Petra ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPACTION; DEGREES OF FREEDOM (MECHANICS); DRAWING (GRAPHICS); GRAPH THEORY; INTEGER PROGRAMMING;

AUTOMATION ENGINEERING; BRANCH-AND-CUT ALGORITHMS; COMPUTATIONAL EXPERIMENT; GRAPH THEORETICAL CHARACTERIZATION; MATHEMATICAL PROBLEMS; ORTHOGONAL DRAWINGS; ORTHOGONAL REPRESENTATION; TRADITIONAL APPROACHES;

PROBLEM SOLVING;

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

References (13)

1. AGD User Manual. Max-Planck-Institut Saarbrücken, Universität Halle, Universität Köln, 1999. http://www.mpi-sb.mpg.de/AGD.
2. T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes in Computer Science, pages 391-402. Springer-Verlag, 1997.
3. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, 1999.
4. 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.
5. U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes in Computer Science, pages 134-145. Springer-Verlag, 1997.
6. C. Iturriaga and A. Lubiw. Elastic labels: The two-axis case. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes in Computer Science, pages 181-192, 1997.
7. 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.
8. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornuéjols, editor, Integer Programming and Combinatorial Optimization (IPCO ‘99), number 1610 in Springer Lecture Notes in Computer Science, pages 304-319, 1999.
9. K. G. Kakoulis and I. G. Tollis. An algorithm for labeling edges of hierarchical drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD ‘97), volume 1353 of Lecture Notes in Computer Science, pages 169-180, 1997.
10. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.
11. 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.
12. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
13. A. Wolff and T. Strijk. The map labeling bibliography. http://www.inf.fu-berlin.de/map-labeling/bibliography.