How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243)
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 7103279
| 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 7103279 |
Statements
How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (English)
0 references
10 September 2019
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
1.0000001
0 references
0.7771654
0 references
0.7768021
0 references
0.7768021
0 references
0.7741265
0 references
0.7741265
0 references
0.77244174
0 references
0.76708627
0 references
