Parameterized Complexity of Conflict-Free Graph Coloring.
Hans L. BodlaenderSudeshna KolayAstrid PietersePublished in: WADS (2019)
Keyphrases
- conflict free
- parameterized complexity
- graph coloring
- symmetry breaking
- combinatorial problems
- global constraints
- functional dependencies
- job shop scheduling
- constraint satisfaction problems
- phase transition
- constraint programming
- max sat
- fixed parameter tractable
- scheduling problem
- database schemes
- hyper heuristics
- argumentation frameworks
- genetic algorithm
- job shop scheduling problem
- constraint satisfaction
- artificial bee colony
- desirable properties
- sat solvers
- optimal solution
- decision making