Hardness of some variants of the graph coloring game.
Thiago MarcilonNicolas Almeida MartinsRudini M. SampaioPublished in: CoRR (2019)
Keyphrases
- graph coloring
- phase transition
- combinatorial problems
- np complete problems
- job shop scheduling
- constraint satisfaction
- scheduling problem
- satisfiability problem
- max sat
- game playing
- hyper heuristics
- constraint satisfaction problems
- randomly generated
- traveling salesman problem
- cellular automata
- metaheuristic
- np complete
- genetic algorithm
- worst case
- np hard
- constraint programming
- heuristic search
- job shop scheduling problem
- sat problem
- artificial bee colony
- simulated annealing
- search space