SDE: graph drawing using spectral distance embedding

Authors:
Ali Civril;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'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 2
Cited 6

Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing by High-Dimensional Embedding

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing

Findings from an empirical study of fine-grained human social contacts

WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
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
Graph visualization with latent variable models

Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Discrete bi-Laplacians and biharmonic b-splines

ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Graph drawing by classical multidimensional scaling: new perspectives

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matrix to approximate the graph theoretical distances. The algorithm preserves symmetry and node densities, i.e., the drawings are aesthetically pleasing. The runtime for typical 20,000 node graphs ranges from 100 to 150 seconds.