PSPACE-completeness of two graph coloring games.
Eurinardo Rodrigues CostaVictor Lage PessoaRudini M. SampaioRonan SoaresPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- constraint satisfaction problems
- hyper heuristics
- constraint programming
- scheduling problem
- max sat
- temporal logic
- combinatorial optimization
- distributed constraint optimization problems
- np complete
- artificial bee colony