SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-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.
- 17.Kruskal, J.B., Seery, J.B.: Designing network diagrams. In: Proc. First General Conference on Social Graphics (1980)Google Scholar
- 19.Matousek, J.: Open problems on embeddings of finite metric spaces. Discr. Comput. Geom. (to appear)Google Scholar
- 21.Platt, J.C.: FastMap, MetricMap, and landmarkMDS are all Nystrom algorithms. In: Proc. 10th Int. Workshop on Artificial Intelligence and Statistics, pp. 261–268 (2005)Google Scholar
- 23.Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)Google Scholar