- Title
- Cutting up is hard to do: the parameterized complexity of k-Cut and related probelms
- Creator
- Downey, Rodney G.; Estivill-Castro, Vladimir; Fellows, Michael R.; Prieto, Elena; Rosamond, Frances A.
- Relation
- Electronic Notes in Theoretical Computer Science Vol. 78, p. 209-222
- Publisher Link
- http://dx.doi.org/10.1016/S1571-0661(04)81014-4
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2003
- Description
- The Graph k-Cut problem is that of finding a set of edges of minimum total weight, in an edge-weighted graph, such that their removal from the graph results in a graph having at least k connected components. An algorithm with a running time of O(nk2) for this problem has been known since 1988, due to Goldschmidt and Hochbaum. We show that the problem is hard for the parameterized complexity class W[1]. We also investigate the complexity of a related problem, cutting a few vertices from a Graph, that asks for the minimum cost of separating at least k vertices from an edge-weighted connected graph. We show that this problem also is hard for W[1].
- Subject
- k-Cut; edges; Goldschmidt; Hochbaum; W[1]
- Identifier
- uon:946
- Identifier
- http://hdl.handle.net/1959.13/26583
- Identifier
- ISSN:1571-0661
- Reviewed
- Hits: 7251
- Visitors: 3674
- Downloads: 0
Thumbnail | File | Description | Size | Format |
---|