Fine-grained parameterized complexity analysis of graph coloring problems (Q5283380)
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: Fine-grained parameterized complexity analysis of graph coloring problems |
scientific article; zbMATH DE number 6751074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained parameterized complexity analysis of graph coloring problems |
scientific article; zbMATH DE number 6751074 |
Statements
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems (English)
0 references
21 July 2017
0 references
0 references
0.796578049659729
0 references
0.7911482453346252
0 references
0.7819316983222961
0 references
0.7676483988761902
0 references
0.7670499086380005
0 references
