Abstract
One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as an energy optimization problem. Their energy is known in the multidimensional scaling (MDS) community as the stress function. In this work, we show how to draw graphs by stress majorization, adapting a technique known in the MDS community for more than two decades. It appears that majorization has advantages over the technique of Kamada and Kawai in running time and stability. We also found the majorization-based optimization being essential to a few extensions to the basic energy model. These extensions can improve layout quality and computation speed in practice.
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
Boisvert, R.F., et al.: The Matrix Market: A web resource for test matrix collections. In: Boisvert, R.F. (ed.) Quality of Numerical Software, Assessment and Enhancement, pp. 125–137. Chapman Hall, Boca Raton (1997), math.nist.gov/MatrixMarket
Brandenburg, F.J., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 76–87. Springer, Heidelberg (1996)
De Leeuw, J.: Convergence of the Majorization Method for Multidimensional Scaling. Journal of Classification 5, 163–180 (1988)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)
Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)
Cohen, J.D.: Drawing Graphs to Convey Proximity: an Incremental Arrangement Method. ACM Transactions on Computer-Human Interaction 4, 197–229 (1997)
Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 364–373. Springer, Heidelberg (1999)
Gajer, P., Goodrich, M.T., Kobourov, S.G.: A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 211–221. Springer, Heidelberg (2001)
Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)
Hadany, R., Harel, D.: A Multi-Scale Method for Drawing Graphs Nicely. Discrete Applied Mathematics 113, 3–21 (2001)
Harel, D., Koren, Y.: A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications 6, 179–202 (2002)
Harel, D., Koren, Y.: Graph Drawing by High-Dimensional Embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 207–219. Springer, Heidelberg (2002)
Koren, Y., Harel, D.: Axis-by-Axis Stress Minimization. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 450–459. Springer, Heidelberg (2004)
Koren, Y.: Graph Drawing by Subspace Optimization. In: Proceedings 6th Joint Eurographics – IEEE TCVG Symposium Visualization (VisSym 2004). Eurographics, pp. 65–74 (2004)
Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7–15 (1989)
Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
Kruskal, J., Seery, J.: Designing network diagrams. In: Proceedings First General Conference on Social Graphics, pp. 22–50 (1980)
Sammon, J.W.: A Nonlinear Mapping for Data Structure Analysis. IEEE Trans. on Computers 18, 401–409 (1969)
Walshaw, C.: A Multilevel Algorithm for Force-Directed Graph Drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 171–182. Springer, Heidelberg (2001)
Intel Math Kernel Library, http://www.intel.com/software/products/mkl/
Automatically Tuned Linear Algebra Software (ATLAS), http://atlas.sourceforge.net/
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
Gansner, E.R., Koren, Y., North, S. (2005). Graph Drawing by Stress Majorization. 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_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_25
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)