Expander Decomposition and Pruning - Faster, Stronger, and Simpler
SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, pp. 2616-2635, 2019.
We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In particular, we use a natural bicriteria notion motivated by Kannan, Vempala, and Vetta  which we ref...More
PPT (Upload PPT)