Kernelization using structural parameters on sparse graph classes (Q340583)
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: Kernelization using structural parameters on sparse graph classes |
scientific article; zbMATH DE number 6652749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kernelization using structural parameters on sparse graph classes |
scientific article; zbMATH DE number 6652749 |
Statements
Kernelization using structural parameters on sparse graph classes (English)
0 references
14 November 2016
0 references
parameterized complexity
0 references
kernelization
0 references
nowhere dense graphs
0 references
finite integer index
0 references
tree-depth
0 references
0 references
0 references
0.9244055151939392
0 references
0.8198789358139038
0 references
0.8142604231834412
0 references
0.8065696358680725
0 references
0.8024699091911316
0 references
