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.
This material is based upon work partially supported by the National Science Foundation under Grant Nos. 0323324, 0324947.
Chapter PDF
Similar content being viewed by others
References
Civril, A., Magdon-Ismail, M., Rivele, E.B.: SDE: Graph drawing using spectral distance embedding. Technical report, Rensselaer Polytechnic Institute (2005)
Harel, D., Koren, Y.: Graph drawing by high-dimensional embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528. Springer, Heidelberg (2002)
Koren, Y., Harel, D., Carmel, L.: Drawing graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation 1(4), 645–673 (2003)
Tollis, I.G., Battista, G.D., Eades, P., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Civril, A., Magdon-Ismail, M., Bocek-Rivele, E. (2006). SDE: Graph Drawing Using Spectral Distance Embedding. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_48
Download citation
DOI: https://doi.org/10.1007/11618058_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)