Publications
Detailed Information
Polynomiality of sparsest cuts with fixed number of sources
Cited 2 time in
Web of Science
Cited 2 time in Scopus
- Authors
- Issue Date
- 2007-02-22
- Publisher
- Elsevier
- Citation
- Operations Research Letters 35 (6) (2007) 739-742
- Keywords
- Sparsest cut problem ; Fixed number of sources ; Polynomiality
- Abstract
- We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time.
- ISSN
- 0167-6377
- Language
- English
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.