Skip to main content
SpringerLink
Log in

On Spectral Graph Drawing

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2697))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. F.R.K. Chung, Spectral Graph Theory, CBMS Reg. Conf. Ser. Math. 92, American Mathematical Society, 1997.

    Google Scholar 

  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. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, 1996.

    Google Scholar 

  6. K. M. Hall, “An r-dimensional Quadratic Placement Algorithm”, Management Science 17 (1970), 219–229.

    Article  MATH  Google Scholar 

  7. M. Juvan and B. Mohar, “Optimal Linear Labelings and Eigenvalues of Graphs”, Discrete Applied Math. 36 (1992), 153–168.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Kaufmann and D. Wagner (Eds.), Drawing Graphs: Methods and Models, LNCS 2025, Springer Verlag, 2001.

    MATH  Google Scholar 

  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. D.E. Manolopoulos and P.W. Fowler, “Molecular Graphs, Point Groups and Fullerenes”, J. Chem. Phys. 96 (1992), 7603–7614.

    Article  Google Scholar 

  11. B. Mohar, “The Laplacian Spectrum of Graphs”, Graph Theory, Combinatorics, and Applications 2 (1991), 871–898.

    MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Shi and J. Malik, “Normalized Cuts and Image Segmentation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (2000), 888–905.

    Article  Google Scholar 

  14. W. T. Tutte, “How to Draw a Graph”, Proc. London Math. Society 13 (1963), 743–768.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Webb, Statistical Pattern Recognition, Arnold, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel

    Yehuda Koren

Authors
  1. Yehuda Koren
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koren, Y. (2003). On Spectral Graph Drawing. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation