Polynomiality of sparsest cuts with fixed number of sources

Polynomiality of sparsest cuts with fixed number of sources

0.00 Avg rating0 Votes
Article ID: iaor20084112
Country: Netherlands
Volume: 35
Issue: 6
Start Page Number: 739
End Page Number: 742
Publication Date: Nov 2007
Journal: Operations Research Letters
Authors: ,
Abstract:

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

Reviews

Required fields are marked *. Your email address will not be published.