Parameterized complexity of length-bounded cuts and multicuts (Q1799212): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2952915478 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1511.02801 / rank | |||
Normal rank | |||
Revision as of 23:09, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of length-bounded cuts and multicuts |
scientific article |
Statements
Parameterized complexity of length-bounded cuts and multicuts (English)
0 references
18 October 2018
0 references
length-bounded cuts
0 references
parameterized algorithms
0 references
\(\mathsf{W}[1]\)-hardness
0 references
polynomial kernel
0 references
tree-depth
0 references
tree-width
0 references
