Efficient Parallelizable Algorithm for Approximating Sparsest Cut
This paper presents a new algorithm that computes an O(√(log n)/ε)-approximation for the Sparsest Cut problem using O((nε logO(1) n) · Tmaxflow) expected runtime, where Tmaxflow is the runtime of a maxflow algorithm. The algorithm is parallelizable and can be implemented on O(nε) processors in expected parallel runtime O((logO(1) n) · Tmaxflow).