On Spectral Graph Drawing

  • Yehuda Koren
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2697)


The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties. We present a novel view of the spectral approach, which provides a direct link between eigenvectors and the aesthetic properties of the layout. In addition, we present a new formulation of the spectral drawing method with some aesthetic advantages. This formulation is accompanied by an aesthetically-motivated algorithm, which is much easier to understand and to implement than the standard numerical algorithms for computing eigenvectors.


Adjacency Matrix Electronic Nose Aesthetic Property Generalize Eigenvector Spectral Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    U. Brandes and T. Willhalm, “Visualizing Bibliographic Networks with a Reshaped Landscape Metaphor”, Proc. 4th Joint Eurographics — IEEE TCVG Symp. Visualization (VisSym’ 02), pp. 159–164, ACM Press, 2002.Google Scholar
  2. 2.
    L. Carmel, Y. Koren and D. Harel, “Visualizing and Classifying Odors Using a Similarity Matrix”, Proceedings of the ninth International Symposium on Olfaction and Electronic Nose (ISOEN’02), IEEE, to appear, 2003.Google Scholar
  3. 3.
    F.R.K. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, American Mathematical Society, 1997.Google Scholar
  4. 4.
    G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.Google Scholar
  5. 5.
    G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996.Google Scholar
  6. 6.
    K. M. Hall, “An r-dimensional Quadratic Placement Algorithm”, Management Science 17 (1970), 219–229.zbMATHCrossRefGoogle Scholar
  7. 7.
    M. Juvan and B. Mohar, “Optimal Linear Labelings and Eigenvalues of Graphs”, Discrete Applied Math. 36 (1992), 153–168.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    M. Kaufmann and D. Wagner (Eds.), Drawing Graphs: Methods and Models, LNCS 2025, Springer Verlag, 2001.zbMATHGoogle Scholar
  9. 9.
    Y. Koren, L. Carmel and D. Harel, “ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs”, Proceedings of IEEE Information Visualization 2002 (InfoVis’02), IEEE, pp. 137–144, 2002.Google Scholar
  10. 10.
    D.E. Manolopoulos and P.W. Fowler, “Molecular Graphs, Point Groups and Fullerenes”, J. Chem. Phys. 96 (1992), 7603–7614.CrossRefGoogle Scholar
  11. 11.
    B. Mohar, “The Laplacian Spectrum of Graphs”, Graph Theory, Combinatorics, and Applications 2 (1991), 871–898.MathSciNetGoogle Scholar
  12. 12.
    A. Pothen, H. Simon and K.-P. Liou, “Partitioning Sparse Matrices with Eigenvectors of Graphs”, SIAM Journal on Matrix Analysis and Applications, 11 (1990), 430–452.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    J. Shi and J. Malik, “Normalized Cuts and Image Segmentation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (2000), 888–905.CrossRefGoogle Scholar
  14. 14.
    W. T. Tutte, “How to Draw a Graph”, Proc. London Math. Society 13 (1963), 743–768.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    A. Webb, Statistical Pattern Recognition, Arnold, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Yehuda Koren
    • 1
  1. 1.Dept. of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations