DMCA
Graph drawing by stress majorization (2004)
Cached
Download Links
- [www.research.att.com]
- [www.graphviz.org]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- DBLP
Other Repositories/Bibliography
| Venue: | GRAPH DRAWING |
| Citations: | 96 - 13 self |
BibTeX
@INPROCEEDINGS{Gansner04graphdrawing,
author = {Emden R. Gansner and Yehuda Koren and Stephen North},
title = {Graph drawing by stress majorization},
booktitle = {GRAPH DRAWING},
year = {2004},
pages = {239--250},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
One of the most popular graph drawing methods is based of achieving graphtheoretic target ditsances. 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 present a few extensions to the basic energy model which can improve layout quality and computation speed in practice. Majorization-based optimization is essential to these extensions.
