Parameterized Complexity of Conflict-Free Graph Coloring.
Hans L. BodlaenderSudeshna KolayAstrid PietersePublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- graph coloring
- conflict free
- parameterized complexity
- symmetry breaking
- combinatorial problems
- functional dependencies
- job shop scheduling
- global constraints
- phase transition
- constraint satisfaction problems
- fixed parameter tractable
- database schemes
- constraint programming
- scheduling problem
- hyper heuristics
- max sat
- argumentation frameworks
- artificial bee colony
- integrity constraints
- relational databases
- search space
- xml documents
- job shop scheduling problem
- reinforcement learning
- constraint satisfaction