Abstract
Sugiyama’s algorithmic framework for layered graph drawing is commonly used in practical software. The extensive use of dummy vertices to break long edges between non-adjacent layers often leads to unsatisfactorial performance. The worst-case running-time of Sugiyama’s approach is O(|V||E|log|E|) requiring O(|V||E|) memory, which makes it unusable for the visualization of large graphs. By a conceptually simple new technique we are able to keep the number of dummy vertices and edges linear in the size of the graph and hence reduce the worst-case time complexity of Sugiyama’s approach by an order of magnitude to O((|V| + |E|)log|E|) requiring O(|V|+|E|) space.
This work has partially been supported by the DFG-grant Ka512/8-2. It has been performed when the first author was with the Universität Tübingen.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Auber, D.: Tulip – A Huge Graph Visualization Framework. In: Jünger, M. (ed.) Graph Drawing Software, pp. 105–126. Springer, Heidelberg (2003)
Barth, W., Jünger, M., Mutzel, P.: Simple and Efficient Bilayer Cross Counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 130–141. Springer, Heidelberg (2002)
Bastert, O., Matuszewski, C.: Layered drawings of digraphs. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 104–139. Springer, Heidelberg (2001)
Brandes, U., Köpf, B.: Fast and Simple Horizontal Coordinate Assignment. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 31–44. Springer, Heidelberg (2002)
Coffman, E., Graham, R.: Optimal scheduling for two processor systems. Acta Informatica 1, 200–213 (1972)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Eades, P., Kelly, D.: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combin. 21.A, 89–98 (1986)
Eades, P., Wormald, N.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994)
Frick, A.: Upper bounds on the number of hidden nodes in Sugiyama’s algorithm. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 169–183. Springer, Heidelberg (1997)
Gansner, E., Koutsofios, E., North, S., Vo, K.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214–229 (1993)
Graphviz – open source graph drawing software, http://www.research.att.com/sw/tools/graphviz/
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Matuszewski, C., Schönfeld, R., Molitor, P.: Using sifting of k-layer straightline crossing minimization. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 217–224. Springer, Heidelberg (1999)
Nikolov, N., Healy, P.: How to layer a directed acyclic graph. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 16–30. Springer, Heidelberg (2002)
Sander, G.: Graph layout through the VCG tool. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 194–205. Springer, Heidelberg (1995)
Sleator, D., Tarjan, R.E.: Self-Adjusting Binary Search Trees. Journal of the ACM 3, 652–686 (1985)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, SMC 11(2), 109–125 (1981)
VCG – Visualization of Compiler Graphs, http://rw4.cs.uni-sb.de/users/sander/html/gsvcg1.html
Waddle, V., Malhotra, A.: An ElogE line crossing algorithm for levelled graphs. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 59–70. Springer, Heidelberg (1999)
yFiles – a Java Graph Layout and Visualization Library, http://www.yworks.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiglsperger, M., Siebenhaller, M., Kaufmann, M. (2005). An Efficient Implementation of Sugiyama’s Algorithm for Layered Graph Drawing. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)