Graph Drawing by Stress Majorization

  • Emden R. Gansner
  • Yehuda Koren
  • Stephen North
Conference paper

DOI: 10.1007/978-3-540-31843-9_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)
Cite this paper as:
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

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Emden R. Gansner
    • 1
  • Yehuda Koren
    • 1
  • Stephen North
    • 1
  1. 1.AT&T Labs – ResearchFlorham ParkUSA

Personalised recommendations