Spectral graph theory and its applications

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 29-38

  Spielman, Daniel A ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES (OF GRAPHS); EIGENVALUES AND EIGENVECTORS; EIGENVECTORS; SPECTRAL GRAPH THEORY;

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; EIGENVALUES AND EIGENFUNCTIONS; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; TOPOLOGY;

GRAPH THEORY;

EID: 46749087479     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389477     Document Type: Conference Paper

References (29)

1. Alon and Kanale. A spectral technique for coloring random 3-colorable graphs. SICOMP: SIAM Journal on Computing, 26, 1997.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
3. 1, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory, Ser.B,38(1):13-88, 1985.
4. L. Babai, D. Y. Grigoriev, and D. M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In ACM Symposium on Theory of Computing (STOC '82), pages 310-324, Baltimore, USA, May 1982. ACM Press.
5. P. Bonacich. Power and centrality: A family of measures. American Journal of Sociology, 92:1170-1182, 1987.
6. J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis, pages 195-199. Princeton University Press, 1970.
7. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
8. W. E. DONATH and A. J. HOFFMAN. Algorithms for partitioning graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin, 15(3):938-944, 1972.
9. W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17(5):420-425, Sept. 1973.
10. M. Fiedler. Algebraic connectibity of graphs. Czechoslovak Mathematical Journal, 23(98):298-305, 1973.
11. M. Fiedler. Eigenvectors of acyclic matices. Czechoslovak Mathematical Journal, 25(100):607-618, 1975.
12. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Mathematical Journal, 25( 100): 618-633, 1975.
13. S. Guattery and G. L. Miller. On the performance of spectral graph partitioning methods. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 233-242, New York, NY, USA, Jan. 1995. ACM Press.
14. Hagen and Kahng. New spectral methods for ratio cut partitioning and clustering. IEEETCAD: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11, 1992.
15. K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17:219-229, 1970.
16. J. Kleinberg. Authoratitive sources in a hyperlinked environment. Journal of the ACM, 48:604-632, 1999.
17. T. Leighton and S. Rao. Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, Nov. 1999.
18. J. Malik and J. Shi. Normalized cuts and image segmentation. In IEEE Computer Vision and Pattern Recognition or CVPR, pages 731-737, 1997.
19. M. Mihail. Conductance and convergence of Markov chains-A combinatorial treatment of expanders. In 30th Annual Symposium on Foundations of Computer Science, pages 526-531, Research Triangle Park, North Carolina, 30 Oct.-l Nov. 1989. IEEE.
20. B. Mohar. Isoperimetric inequalities, growth, and the spectrum of graphs. Linear Algebra and its Applications, 103:119-131, 1988.
21. B. Mohar. Isoperimetric numbers of graphs. J. Comb. Theory, Ser. B, 47(3): 274-291, 1989.
22. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Computer Science Department, Stanford University, 1998.
23. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation, 82(1):93-133, July 1989.
24. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. Technical Report cs/0607105v3, arXiv, 2006.
25. D. A. Spielman and S.-H. Teng. Spectral partitioning works: Planar graphs and finite element meshes. Linear Algebra and its Applications, 421:284-305, 2007.
26. R. M. Tanner. Explicit construction of concentrators from generalized n-gons. SIAM J. Algebraic Discrete Methods, 5:287-293, 1984.
27. D. A. Tolliver and G. L. Miller. Graph partitioning by spectral rounding: Applications in image segmentation and clustering. In IEEE Computer Vision and Pattern Recognition, pages I: 1053-1060, 2006.
28. L. N. Trefethen and D. Bau. Numerical Linear Algebra. SIAM, Philadelphia, PA, 1997.
29. W. T. Tutte. How to draw a graph. Proc. London Mathematical Society, 13:743-768, 1963.