2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: CME 337: Spectral Graph Theory and Algorithmic Applications

CME 337: Spectral Graph Theory and Algorithmic Applications (MS&E 337)

Brings students to the forefront of a very active area of research. Reviews classic results relating graph expansion and spectra, random walks, random spanning trees, and their electrical network representation. Covers recent progress on graph sparsification, Kadison-Singer problem and approximation algorithms for traveling salesman problems.
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Saberi, A. (PI)
Filter Results:
term offered
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints