Algorithms, Geometry and Learning

Summer 2017, Stanford University
  • Here you can find detailed references and reading material related to the topics covered.

Low Strech Spanning Trees

Spectral Sparsifiers and Effective Resistances.

Decomposing a Graph into Expanders

Spectral Embedding