Almost Exact Graph 3-Coloring in O(1.277^n) Time.
Faisal N. Abu-KhzamMichael A. LangstonPublished in: CTW (2012)
Keyphrases
- graph coloring
- combinatorial problems
- np complete problems
- job shop scheduling
- constraint satisfaction problems
- phase transition
- hamiltonian cycle
- max sat
- constraint satisfaction
- constraint programming
- metaheuristic
- scheduling problem
- hyper heuristics
- orders of magnitude
- job shop scheduling problem
- artificial bee colony
- evolutionary algorithm
- search space
- distributed constraint optimization problems
- neural network