Graph Drawing by Stress Majorization

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)


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.


Conjugate Gradient Stress Function Cholesky Factorization Graph Drawing Stress Optimization 
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.


  1. 1.
    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), Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    De Leeuw, J.: Convergence of the Majorization Method for Multidimensional Scaling. Journal of Classification 5, 163–180 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)zbMATHGoogle Scholar
  5. 5.
    Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  6. 6.
    Cohen, J.D.: Drawing Graphs to Convey Proximity: an Incremental Arrangement Method. ACM Transactions on Computer-Human Interaction 4, 197–229 (1997)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1996)Google Scholar
  10. 10.
    Hadany, R., Harel, D.: A Multi-Scale Method for Drawing Graphs Nicely. Discrete Applied Mathematics 113, 3–21 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Harel, D., Koren, Y.: A Fast Multi-Scale Method for Drawing Large Graphs. Journal of Graph Algorithms and Applications 6, 179–202 (2002)zbMATHMathSciNetGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    Koren, Y., Harel, D.: Axis-by-Axis Stress Minimization. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 450–459. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  14. 14.
    Koren, Y.: Graph Drawing by Subspace Optimization. In: Proceedings 6th Joint Eurographics – IEEE TCVG Symposium Visualization (VisSym 2004). Eurographics, pp. 65–74 (2004)Google Scholar
  15. 15.
    Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7–15 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)zbMATHGoogle Scholar
  17. 17.
    Kruskal, J., Seery, J.: Designing network diagrams. In: Proceedings First General Conference on Social Graphics, pp. 22–50 (1980)Google Scholar
  18. 18.
    Sammon, J.W.: A Nonlinear Mapping for Data Structure Analysis. IEEE Trans. on Computers 18, 401–409 (1969)CrossRefGoogle Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
  21. 21.
  22. 22.
  23. 23.
    Automatically Tuned Linear Algebra Software (ATLAS),

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.AT&T Labs – ResearchFlorham ParkUSA

Personalised recommendations