loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
Spectral Graph Theory and its Applications
Providence, Rhode Island
October 21-October 23
ISBN: 0-7695-3010-9
ASCII Text
x 
 
Daniel A. Spielman, "Spectral Graph Theory and its Applications," Foundations of Computer Science, Annual IEEE Symposium on, pp. 29-38, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/FOCS.2007.56,
author = {Daniel A. Spielman},
title = {Spectral Graph Theory and its Applications},
journal ={Foundations of Computer Science, Annual IEEE Symposium on},
volume = {0},
year = {2007},
issn = {0272-5428},
pages = {29-38},
doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2007.56},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, Annual IEEE Symposium on
TI - Spectral Graph Theory and its Applications
SN - 0272-5428
SP29
EP38
A1 - Daniel A. Spielman,
PY - 2007
KW - null
VL - 0
JA - Foundations of Computer Science, Annual IEEE Symposium on
ER -
 
Spectral graph theory is the study of the eigenvalues and eigenvectors of matrices associated with graphs. In this tutorial, we will try to provide some intuition as to why these eigenvectors and eigenvalues have combinatorial significance, and will survey some of their applications.
Citation:
Daniel A. Spielman, "Spectral Graph Theory and its Applications," focs, pp.29-38, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.