SSDE: fast graph drawing using sampled spectral distance embedding

Authors:
Ali Çivril;Malik Magdon-Ismail;Eli Bocek-Rivele
Affiliations:
Computer Science Department, RPI, Troy, NY;Computer Science Department, RPI, Troy, NY;Computer Science Department, RPI, Troy, NY
Venue:
GD'06 Proceedings of the 14th international conference on Graph drawing
Year:
2006

Citing 9
Cited 4

An algorithm for drawing general undirected graphs

Information Processing Letters
Graph drawing by force-directed placement

Software—Practice & Experience
Drawing graphs: methods and models

Drawing graphs: methods and models
Approximation algorithms

Approximation algorithms
Graph Drawing by High-Dimensional Embedding

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

SIAM Journal on Computing
One-dimensional layout optimization, with applications to graph drawing by axis separation

Computational Geometry: Theory and Applications
On spectral graph drawing

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
SDE: graph drawing using spectral distance embedding

GD'05 Proceedings of the 13th international conference on Graph Drawing

An Experimental Study on Distance-Based Graph Drawing

Graph Drawing
Graph drawing by classical multidimensional scaling: new perspectives

GD'12 Proceedings of the 20th international conference on Graph Drawing
Scalable parallel graph partitioning

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
OClustR: A new graph-based algorithm for overlapping clustering

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. ClassicalMulti-Dimensional Scaling yields a quadratic-time spectral algorithm, which approximates the real distances of the nodes in the final drawing with their graph theoretical distances. We build from this idea to develop the linear-time spectral graph drawing algorithm SSDE. We reduce the space and time complexity of the spectral decomposition by approximating the distance matrix with the product of three smaller matrices, which are formed by sampling rows and columns of the distance matrix. The main advantages of our algorithm are that it is very fast and it gives aesthetically pleasing results, when compared to other spectral graph drawing algorithms. The runtime for typical 105 node graphs is about one second and for 106 node graphs about ten seconds.