SDE: Graph Drawing Using Spectral Distance Embedding

Civril, Ali and Magdon-Ismail, Malik and Bocek-Rivele, Eli (2006) SDE: Graph Drawing Using Spectral Distance Embedding. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 512-513 (Official URL: http://dx,doi.org/10.1007/11618058_48).

Full text not available from this repository.

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.

Item Type:Conference Poster
Additional Information:10.1007/11618058_48
Classifications:M Methods > M.100 Algebraic
P Styles > P.720 Straight-line
G Algorithms and Complexity > G.560 Geometry
ID Code:729

Repository Staff Only: item control page

References

A. Civril, M. Magdon-Ismail, and E. B. Rivele. SDE: Graph drawing using spectral distance embedding. Technical report, Rensselaer Polytechnic Institute, 2005.

D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In GD02, LNCS. Springer-Verlag, 2002.

Y. Koren, D. Harel, and L. Carmel. Drawing graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003. SIAM.

I. G. Tollis, G. D. Battista, P. Eades, and R. Tamassia. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.