An efficient implementation of Sugiyama's algorithm for layered graph drawing

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 155-166

  Eiglsperger, Markus ^a   Siebenhaller, Martin ^b   Kaufmann, Michael ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DRAWING (GRAPHICS); LINEARIZATION; VISUALIZATION; ALGORITHMS;

LAYERED GRAPH DRAWING; SUGIYAMA'S ALGORITHMS; TIME COMPLEXITY;

ALGORITHMS; DRAWING (GRAPHICS);

ADJACENT LAYERS; ALGORITHMIC FRAMEWORK; EFFICIENT IMPLEMENTATION; LARGE GRAPHS; LAYERED GRAPH DRAWING; RUNNING TIME; S-ALGORITHMS; TIME COMPLEXITY;

EID: 24144435951     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. D. Auber: Tulip - A Huge Graph Visualization Framework. In: Jünger, Mutzel (eds.): Graph Drawing Software, Springer-Verlag, pp. 105-126, 2003.
2. W. Barth, M. Jünger and P. Mutzel: Simple and Efficient Bilayer Cross Counting. In: Proceedings of Graph Drawing 2002, Springer LNCS 2528, pp. 130-141, 2002.
3. O. Bastert and C. Matuszewski: Layered drawings of digraphs. In: Kaufmann, Wagner (eds.): Drawing Graphs: Methods and Models, Springer LNCS 2025, pp. 104-139, 2001.
4. U. Brandes and B. Köpf: Fast and Simple Horizontal Coordinate Assignment. In: Proceedings of Graph Drawing 2001, Springer LNCS 2265, pp. 31-44, 2001.
5. E. Coffman and R. Graham: Optimal scheduling for two processor systems. Acta Informatica, 1: 200-213, 1972.
6. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
7. P. Eades and D. Kelly: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combin., 21.A: 89-98, 1986.
8. P. Eades and N. Wormald: Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4): 379-403, 1994.
9. A. Frick: Upper bounds on the number of hidden nodes in Sugiyama's algorithm. In: Proceedings of Graph Drawing 1996, Springer LNCS 1190, pp. 169-183, 1996.
10. E. Gansner, E. Koutsofios, S. North and K. Vo: A technique for drawing directed graphs. In: IEEE Transactions on Software Engineering, 19(3): 214-229, 1993.
11. Graphviz - open source graph drawing software: http://www.research.att. com/sw/tools/graphviz/.
12. R. M. Karp: Reducibility among Combinatorial Problems. In: Miller R. E., Thatcher J. W. (eds.): Complexity of Computer Computations, Plenum Press, New York, pp. 85-103, 1972.
13. C. Matuszewski, R. Schönfeld and P. Molitor: Using sifting of k-layer straightline crossing minimization. In: Proceedings of the 7th Symposium on Graph Drawing (GD'99), Springer LNCS 1731, pp. 217-224, 1999.
14. N. Nikolov and P. Healy: How to layer a directed Acyclic Graph. In: Proceedings of the 9th Symposium on Graph Drawing (GD'01), Springer LNCS 2265, pp. 16-30, 2002.
15. G. Sander: Graph layout through the VCG tool. In: Proceedings of Graph Drawing 1994, Springer LNCS 894, pp. 194-205, 1995.
16. D. Sleator and R. E. Tarjan: Self-Adjusting Binary Search Trees. In: Journal of the ACM, 3: 652-686, 1985.
17. K. Sugiyama, S. Tagawa and M. Toda: Methods for visital understanding of hierarchical system structures. In: IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2): 109-125, 1981.
18. VCG - Visualization of Compiler Graphs: http://rw4.cs.uni-sb.de/users/ sander/html/gsvcg1.html.
19. V. Waddle and A. Malhotra: An E log E line crossing algorithm for levelled graphs. In: Proceedings of the 7th Symposium on Graph Drawing (GD'99), Springer LNCS 1731, pp. 59-70, 1999.
20. yFiles - a Java Graph Layout and Visualization Library: http://www.yworks.com.