S-Space College of Engineering/Engineering Practice School (공과대학/대학원) Dept. of Industrial Engineering (산업공학과) Journal Papers (저널논문_산업공학과)
Polynomiality of sparsest cuts with fixed number of sources
- Hong, Sung-Pil; Choi, Byung-Cheon
- Issue Date
- Operations Research Letters 35 (6) (2007) 739-742
- We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.
- Files in This Item: There are no files associated with this item.