Parameterized complexity of secluded connectivity problems (Q2408560)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6790466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of secluded connectivity problems |
scientific article; zbMATH DE number 6790466 |
Statements
Parameterized complexity of secluded connectivity problems (English)
0 references
12 October 2017
0 references
secluded path
0 references
secluded Steiner tree
0 references
parameterized complexity
0 references
kernelization
0 references
0 references
0 references
0.9823704957962036
0 references
0.8215718865394592
0 references
0.7666013240814209
0 references
