Parameterized complexity of length-bounded cuts and multicuts (Q1799212)
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: Parameterized complexity of length-bounded cuts and multicuts |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.9964393
0 references
0.93655765
0 references
0.93655765
0 references
0.9312663
0 references
0.9230776
0 references
0.9230776
0 references
0.92248476
0 references
0.92248476
0 references
0.91787064
0 references
0 references
