Graph Drawing by Stress Majorization

By Emden R. Gansner, Yehuda Koren, Stephen C. North. International Symposium Graph Drawing and Network Visualization, 2004

482 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Energy Models for Graph Clustering (2007, unknown): “Gansner, Koren and North [22, Section 3] adapt the Kamada-Kawai energy model (and similar models) for the same purpose, by increasing the desired edge length between high-degree nodes.”
Ant-based and swarm-based clustering (2007, methodology): “Advanced MDS techniques, such as stress majorization (Gansner et al. 2004), can be used to solve this problem efficiently.”
A survey of two-dimensional graph layout techniques for information visualisation (2013, methodology): “The difference between the two is that Kamada and Kawai use Newton–Raphson iteration to find the minima whereas distance scaling minimises the stress through the statistical technique of stress majorisation.(44) Distance scaling was first used for graph drawing by Kruskal and Seery(45) for social ne”