On the fine-grained complexity of rainbow coloring (Q3174728)
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 6904931
| 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 6904931 |
Statements
On the Fine-Grained Complexity of Rainbow Coloring (English)
0 references
18 July 2018
0 references
graph coloring
0 references
computational complexity
0 references
lower bounds
0 references
FPT algorithms
0 references
0.9910176992416382
0 references
0.9344289898872375
0 references
0.9273201823234558
0 references
0.920521080493927
0 references
0.853543758392334
0 references
