FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222)
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: FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders |
scientific article; zbMATH DE number 6642922
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders |
scientific article; zbMATH DE number 6642922 |
Statements
24 October 2016
0 references
kernelization
0 references
parameterized complexity
0 references
pathwidth
0 references
well-quasi-ordering
0 references
0 references
0 references
FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (English)
0 references
