Parameterized algorithms for conflict-free colorings of graphs (Q1786593)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
