Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems (Q2843923)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems |
scientific article; zbMATH DE number 6201784
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems |
scientific article; zbMATH DE number 6201784 |
Statements
27 August 2013
0 references
Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems (English)
0 references
