Geometry, Flows, and Graph-Partitioning Algorithms
"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned into two (or more) large pieces while minimizing the number of the edges that cross the cut. The goal of this paper is to survey an interesting combination of techniques that have recently led to progress on graph partioning problems.