Parameterized Complexity of Conflict-free Graph Coloring.
Hans L. BodlaenderSudeshna KolayAstrid PietersePublished in: CoRR (2019)
Keyphrases
- graph coloring
- conflict free
- parameterized complexity
- symmetry breaking
- combinatorial problems
- global constraints
- job shop scheduling
- functional dependencies
- constraint satisfaction problems
- phase transition
- database schemes
- max sat
- scheduling problem
- fixed parameter tractable
- constraint programming
- hyper heuristics
- argumentation frameworks
- arc consistency
- combinatorial optimization
- genetic algorithm