On the fine-grained complexity of rainbow coloring (Q4606330)
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: On the fine-grained complexity of rainbow coloring |
scientific article; zbMATH DE number 6846429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the fine-grained complexity of rainbow coloring |
scientific article; zbMATH DE number 6846429 |
Statements
2 March 2018
0 references
graph coloring
0 references
computational complexity
0 references
lower bounds
0 references
exponential time hypothesis
0 references
FPT algorithms
0 references
On the Fine-Grained Complexity of Rainbow Coloring (English)
0 references
0.9910176992416382
0 references
0.943537414073944
0 references
0.941262423992157
0 references
0.9317712783813475
0 references
0.8565644025802612
0 references
