An Experimental Study on Distance-Based Graph Drawing

Authors:
Ulrik Brandes;Christian Pich
Affiliations:
Department of Computer & Information Science, University of Konstanz,;Department of Computer & Information Science, University of Konstanz,
Venue:
Graph Drawing
Year:
2009

Citing 12
Cited 8

An algorithm for drawing general undirected graphs

Information Processing Letters
Fixed edge-length graph drawing is NP-hard

Discrete Applied Mathematics
Drawing graphs to convey proximity: an incremental arrangement method

ACM Transactions on Computer-Human Interaction (TOCHI)
Drawing on physical analogies

Drawing graphs
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms

GD '95 Proceedings of the Symposium on Graph Drawing
GRIP: Graph dRawing with Intelligent Placement

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Nonlinear Mapping for Data Structure Analysis

IEEE Transactions on Computers
SSDE: fast graph drawing using sampled spectral distance embedding

GD'06 Proceedings of the 14th international conference on Graph drawing
Eigensolver methods for progressive multidimensional scaling of large data

GD'06 Proceedings of the 14th international conference on Graph drawing
An experimental comparison of fast algorithms for drawing general large graphs

GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization

GD'04 Proceedings of the 12th international conference on Graph Drawing

Interactive visualization and navigation of web search results revealing community structures and bridges

Proceedings of Graphics Interface 2010
An experimental evaluation of multilevel layout methods

GD'10 Proceedings of the 18th international conference on Graph drawing
More flexible radial layout

GD'09 Proceedings of the 17th international conference on Graph Drawing
A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing

GD'11 Proceedings of the 19th international conference on Graph Drawing
Scalable, versatile and simple constrained graph layout

EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Graph drawing by classical multidimensional scaling: new perspectives

GD'12 Proceedings of the 20th international conference on Graph Drawing
Planar preprocessing for spring embedders

GD'12 Proceedings of the 20th international conference on Graph Drawing
Improving multiple aesthetics produces better graph drawings

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In numerous application areas, general undirected graphs need to be drawn, and force-directed layout appears to be the most frequent choice. We present an extensive experimental study showing that, if the goal is to represent the distances in a graph well, a combination of two simple algorithms based on variants of multidimensional scaling is to be preferred because of their efficiency, reliability, and even simplicity. We also hope that details in the design of our study help advance experimental methodology in algorithm engineering and graph drawing, independent of the case at hand.