Article ID Journal Published Year Pages File Type
1143148 Operations Research Letters 2007 4 Pages PDF
Abstract
We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Polynomiality of sparsest cuts with fixed number of sources
Authors
, ,