Publications
Detailed Information
Polynomiality of sparsest cuts with fixed number of sources
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hong, Sung-Pil | - |
| dc.contributor.author | Choi, Byung-Cheon | - |
| dc.date.accessioned | 2009-07-08T06:11:56Z | - |
| dc.date.available | 2009-07-08T06:11:56Z | - |
| dc.date.issued | 2007-02-22 | - |
| dc.identifier.citation | Operations Research Letters 35 (6) (2007) 739-742 | en |
| dc.identifier.issn | 0167-6377 | - |
| dc.identifier.uri | https://hdl.handle.net/10371/5333 | - |
| dc.description.abstract | We show that when the number of sources is constant the sparsest cut problem is solvable in polynomial time. | en |
| dc.description.sponsorship | The research was partially supported by KOSEF research fund R01-2005-000-10271-0. | en |
| dc.language.iso | en | - |
| dc.publisher | Elsevier | en |
| dc.subject | Sparsest cut problem | en |
| dc.subject | Fixed number of sources | en |
| dc.subject | Polynomiality | en |
| dc.title | Polynomiality of sparsest cuts with fixed number of sources | en |
| dc.type | Article | en |
| dc.contributor.AlternativeAuthor | 홍성필 | - |
| dc.contributor.AlternativeAuthor | 최병천 | - |
| dc.identifier.doi | 10.1016/j.orl.2006.12.011 | - |
| dc.identifier.doi | 10.1016/j.orl.2006.12.011 | - |
| dc.citation.journaltitle | Operations Research Letters | - |
- Appears in Collections:
- 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.