An Experimental Study on Distance-Based Graph Drawing

Brandes, Ulrik and Pich, Christian (2009) An Experimental Study on Distance-Based Graph Drawing. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 218-229(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_21).

Full text not available from this repository.

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.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_21
Classifications: G Algorithms and Complexity > G.070 Area / Edge Length
M Methods > M.400 Force-directed / Energy-based
P Styles > P.720 Straight-line
URI: http://gdea.informatik.uni-koeln.de/id/eprint/908

Actions (login required)

View Item View Item