Graph partitioning using single commodity flows

@inproceedings{Khandekar2006GraphPU,
  title={Graph partitioning using single commodity flows},
  author={Rohit Khandekar and Satish Rao and Umesh V. Vazirani},
  booktitle={STOC},
  year={2006}
}
We show that the sparsest cut in graphs can be approximated within O(log2 n) factor in Õ(n3/2) time using polylogarithmic single commodity max-flow computations. Previous algorithms are based on multicommodity flows which take time Õ(n2). Our algorithm iteratively employs max-flow computations to embed an expander flow, thus providing a certificate of expansion. Our technique can also be extended to yield an O(log2 n) (pseudo) approximation algorithm for the edge-separator problem with a… CONTINUE READING