Graph coloring with no large monochromatic components.
Nathan LinialJirí MatousekOr SheffetGábor TardosPublished in: Electron. Notes Discret. Math. (2007)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- max sat
- constraint satisfaction problems
- hamiltonian cycle
- scheduling problem
- neural network
- traveling salesman problem
- constraint programming
- metaheuristic
- artificial bee colony
- cost function
- evolutionary algorithm
- objective function
- distributed constraint optimization problems