Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127)
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: Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs |
scientific article; zbMATH DE number 6880778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs |
scientific article; zbMATH DE number 6880778 |
Statements
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (English)
0 references
5 June 2018
0 references
conflict-free coloring
0 references
unique-maximum coloring
0 references
FPT algorithms
0 references
maximization algorithms
0 references
0 references
0.9677794
0 references
0 references
0.91872215
0 references
0.91872215
0 references
0.91097236
0 references
0.9107588
0 references
0.9107588
0 references
0.91030884
0 references
0.89667857
0 references
0.8963578
0 references
