Polynomiality of sparsest cuts with fixed number of sources

We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.