How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q5111869)
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: How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? |
scientific article; zbMATH DE number 7205194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? |
scientific article; zbMATH DE number 7205194 |
Statements
27 May 2020
0 references
parameterized complexity
0 references
polynomial kernels
0 references
structural parameters
0 references
treedepth
0 references
treewidth
0 references
sparse graphs
0 references
0 references
0 references
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (English)
0 references
0.9987182021141052
0 references
0.8142604231834412
0 references
0.8095901608467102
0 references
0.8028798699378967
0 references
0.8025539517402649
0 references
