Complexity of conflict-free colorings of graphs (Q484316)
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 6383896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of conflict-free colorings of graphs |
scientific article; zbMATH DE number 6383896 |
Statements
Complexity of conflict-free colorings of graphs (English)
0 references
6 January 2015
0 references
conflict-free coloring
0 references
NP-completeness
0 references
parametrized algorithm
0 references
0 references
0.9061301350593568
0 references
0.9058216214179992
0 references
0.8503459095954895
0 references
0.8329030871391296
0 references
0.8319503664970398
0 references
