Tags » Spectral Partitioning
In Lecture 2, we used spectral partitioning to rule out the existence of a strong parallel repetition theorem for unique games. In practice, spectral methods are a very successful heuristic for graph partitioning, and in the present lecture we’ll see how to analyze these partitioning algorithms for some common families of graphs. 1,349 more words
In June, I wrote about my work on using spectral partitioning to approximate Max Cut.