Parameterized algorithms for conflict-free colorings of graphs (Q1786593)
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: Parameterized algorithms for conflict-free colorings of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for conflict-free colorings of graphs |
scientific article |
Statements
Parameterized algorithms for conflict-free colorings of graphs (English)
0 references
24 September 2018
0 references
conflict-free coloring
0 references
parameterized complexity
0 references
NP-complete
0 references
0 references
0 references
0.9058216214179992
0 references
0.8497925996780396
0 references
0.8332399725914001
0 references
0.8283717036247253
0 references
0.8165391087532043
0 references
