Drawing graphs by eigenvectors: Theory and practice

Computers and Mathematics with Applications

Volumn 49, Issue 11-12, 2005, Pages 1867-1888

  Koren, Y ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Eigenvectors; Fiedler vector; Force directed layout; Graph drawing; Laplacian; Spectral graph theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; OPTIMIZATION; VECTORS;

FIEDLER VECTORS; FORCE-DIRECTED LAYOUT; GRAPH DRAWING; LAPLACIAN; SPECTRAL GRAPH THEORY;

GRAPH THEORY;

EID: 27544467094     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2004.08.015     Document Type: Article

References (30)

1. th Inter. Computing and Combinatorics Conference (CO-COON'03), LNCS 2697 2003 Springer-Verlag New York 496 508
2. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Graph Drawing: Algorithms for the Visualization of Graphs 1999 Prentice Hall
3. M. Kaufmann D. Wagner Drawing Graphs: Methods and Models, LNCS 2025 2001 Springer-Verlag
4. K.M. Hall An r-dimensional quadratic placement algorithm Management Science 17 1970 219 229
5. F.R.K. Chung Spectral graph theory CBMS Reg. Conf. Ser. Math. 92 1997 American Mathematical Society
6. B. Mohar The Laplacian spectrum of graphs Graph Theory, Combinatorics, and Applications 2 1991 871 898
7. J. Shi, and J. Malik Normalized cuts and image segmentation IEEE Transactions on Pattern Analysis and Machine Intelligence 22 2000 888 905
8. 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
9. M. Juvan, and B. Mohar Optimal linear labelings and eigenvalues of graphs Discrete Applied Math 36 1992 153 168
10. Walshaw's Collection, www.gre.ac.uk/~c.walshaw/partition.
11. J. Shawe-Taylor and T. Pisanski, Characterizing graph drawing with eigenvectors, In Technical Report CSD-TR-93-20, Royal Holloway, University of London, Department of Computer Science, Egham, Surrey TW20 0EX, England.
12. D.E. Manolopoulos, and P.W. Fowler Molecular graphs, point groups and fullerenes J. Chem. Phys. 96 1992 7603 7614
13. th Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym'02) 2002 ACM Press 159 164
14. P. Eades A heuristic for graph drawing Congressus Numerantium 42 1984 149 160
15. T.M.G. Fruchterman, and E. Reingold Graph drawing by force-directed placement Software-Practice and Experience 21 1991 1129 1164
16. Arnold A. Webb Statistical Pattern Recognition 1999
17. th International Symposium on Olfaction and Electronic Nose (ISOEN'02) 2003 IEEE
18. W.T. Tutte How to draw a graph Proc. London Math. Society 13 1963 743 768
19. G.H. Golub, and C.F. Van Loan Matrix Computations 1996 Johns Hopkins University Press
20. Y. Koren, L. Carmel, and D. Harel Drawing huge graphs by algebraic multigrid optimization Multiscale Modeling and Simulation 1 2003 645 673
21. th Graph Drawing (GD'00), Lecture Notes in Computer Science, Volume 1984 2000 Springer-Verlag 211 221
22. D. Harel, and Y. Koren A fast multi-scale method for drawing large graphs Journal of Graph Algorithms and Applications 6 2002 179 202
23. th Graph Drawing (GD'00), Lecture Notes in Computer Science, Volume 1984 2000 Springer-Verlag 183 196
24. A. Quigley, and P. Eades FADE: Graph drawing, clustering, and visual abstraction Proc. 8th Graph Drawing (GD'00), Lecture Notes in Computer Science, Volume 1984 2000 Springer-Verlag 197 210
25. C. Walshaw A multilevel algorithm for force-directed graph drawing Journal of Graph Algorithms and Applications 7 2003 253 285
26. th Graph Drawing (GD'02), LNCS 2528 2002 Springer-Verlag 207 219
27. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press
28. D.S. Hochbaum Approximation Algorithms for NP-Hard Problems 1996 PWS Publishing Company
29. Y. Koren, and L. Carmel Robust linear dimensionality reduction IEEE Transactions on Visualization and Computer Graphics 10 2004 459 470
30. The Matrix Market Collection, math.nist.gov/MatrixMarket.