Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531)
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: Approximate Turing Kernelization for Problems Parameterized by Treewidth |
scientific article; zbMATH DE number 7651199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate Turing Kernelization for Problems Parameterized by Treewidth |
scientific article; zbMATH DE number 7651199 |
Statements
7 February 2023
0 references
approximation
0 references
Turing kernelization
0 references
graph problems
0 references
treewidth
0 references
Approximate Turing Kernelization for Problems Parameterized by Treewidth (English)
0 references
0 references
0 references
0.8954608
0 references
0.89098895
0 references
0.8820173
0 references
0.8820173
0 references
0.8725266
0 references
0.8718863
0 references
0.87108505
0 references
0 references
