Partitioning Well-Clustered Graphs with k-Means and Heat Kernel
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations