A fast layout algorithm for k-level graphs

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

Volumn 1984, Issue , 2001, Pages 229-240

  Buchheim, Christoph ^a   Jünger, Michael ^a   Leipert, Sebastian ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

LAYOUT ALGORITHMS; LEVEL GRAPHS; THIRD PHASE; TOTAL LENGTH;

ALGORITHMS;

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

References (8)

1. F. J. Brandenburg, M. Jünger, and P. Mutzel. Algorithmen zum automatischen Zeichnen von Graphen. Informatik-Spektrum 20, pages 199-207, 1997.
2. C. Buchheim, M. Jünger, and S. Leipert. A fast layout algorithm for k-level graphs. Technical report, Institut für Informatik, Universität zu Köln, 1999.
3. E. R. Gansner, E. Koutsofios, S. C. North, and K.-P. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214-230, 1993.
4. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312-316, 1983.
5. 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-25, 1997.
6. Petra Mutzel et al. A library of algorithms for graph drawing. In S. H. Whitesides, editor, Graph Drawing '98, volume 1547 of Lecture Notes in Computer Science, pages 456-457. Springer Verlag, 1998.
7. G. Sander. A fast heuristic for hierarchical Manhattan layout. In F. J. Brandenburg, editor, Graph Drawing '95, volume 1027 of Lecture Notes in Computer Science, pages 447-458. Springer Verlag, 1996.
8. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, 1981.