SDE: Graph Drawing Using Spectral Distance Embedding

  • Ali Civril
  • Malik Magdon-Ismail
  • Eli Bocek-Rivele
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3843)

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.

References

  1. 1.
    Civril, A., Magdon-Ismail, M., Rivele, E.B.: SDE: Graph drawing using spectral distance embedding. Technical report, Rensselaer Polytechnic Institute (2005)Google Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Koren, Y., Harel, D., Carmel, L.: Drawing graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation 1(4), 645–673 (2003)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Tollis, I.G., Battista, G.D., Eades, P., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ali Civril
    • 1
  • Malik Magdon-Ismail
    • 1
  • Eli Bocek-Rivele
    • 1
  1. 1.Computer Science DepartmentRPITroy

Personalised recommendations