An Experimental Study on Distance-Based Graph Drawing

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.

[1]  J. Gower.  Adding a point to vector diagrams in multivariate analysis , 1968 .

[2]  Joshua B. Tenenbaum,et al.  Sparse multidimensional scaling using land-mark points , 2004 .

[3]  Victor E. McGee,et al.  THE MULTIDIMENSIONAL ANALYSIS OF ‘ELASTIC’ DISTANCES , 1966 .

[4]  Malik Magdon-Ismail,et al.  SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding , 2006, Graph Drawing.

[5]  Yehuda Koren,et al.  Graph Drawing by Stress Majorization , 2004, GD.

[6]  Michael Jünger,et al.  An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs , 2005, GD.

[7]  George Michailidis,et al.  Graph Layout Techniques and Multidimensional Data Analysis , 1999 .

[8]  Franz-Josef Brandenburg,et al.  An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms , 1995, GD.

[9]  J. Leeuw.  Applications of Convex Analysis to Multidimensional Scaling , 2000 .

[10]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[11]  George Michailidis,et al.  Data Visualization through Graph Drawing , 2001, Comput. Stat..

[12]  J. Barra,et al.  Recent Developments in Statistics , 1978 .

[13]  Peter Eades,et al.  Fixed edge-length graph drawing is NP-hard , 1990, Discret. Appl. Math..

[14]  J. Gower.  Some distance properties of latent root and vector methods used in multivariate analysis , 1966 .

[15]  P. Groenen,et al.  Modern multidimensional scaling , 1996 .

[16]  R. Marshall.  5. Multidimensional Scaling. 2nd edn. Trevor F. Cox and Michael A. A. Cox, Chapman & Hall/CRC, Boca Raton, London, New York, Washington DC, 2000. No. of pages: xiv + 309. Price: $79.95. ISBN 1‐58488‐094‐5 , 2002 .

[17]  Andreas Buja,et al.  Visualization Methodology for Multidimensional Scaling , 2002, J. Classif..

[18]  Jonathan D. Cohen,et al.  Drawing graphs to convey proximity: an incremental arrangement method , 1997, TCHI.

[19]  Ulrik Brandes,et al.  Drawing on Physical Analogies , 2001, Drawing Graphs.

[20]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[21]  Hiroshi Hosobe.  A high-dimensional approach to interactive graph visualization , 2004, SAC '04.

[22]  J. Kruskal.  Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[23]  R. Sibson.  Studies in the Robustness of Multidimensional Scaling: Procrustes Statistics , 1978 .

[24]  Ulrik Brandes,et al.  Eigensolver Methods for Progressive Multidimensional Scaling of Large Data , 2006, GD.