Minimum conflict free colouring parameterized by treewidth (Q779250)
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: Minimum conflict free colouring parameterized by treewidth |
scientific article; zbMATH DE number 7223715
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum conflict free colouring parameterized by treewidth |
scientific article; zbMATH DE number 7223715 |
Statements
Minimum conflict free colouring parameterized by treewidth (English)
0 references
21 July 2020
0 references
conflict-free colouring of graphs
0 references
parameterized complexity
0 references
FPT algorithms
0 references
treewidth
0 references
exponential time hypothesis
0 references
strong exponential time hypothesis
0 references
0 references
0.9105404
0 references
0.9105404
0 references
0.90412474
0 references
0.8840352
0 references
0.88356113
0 references
0 references
0.8821815
0 references
0.8820204
0 references
