The Complexity of Near-Optimal Graph Coloring.

M. R. Garey David S. Johnson

Published in: J. ACM (1976)

Keyphrases

graph coloring
combinatorial problems
job shop scheduling
np complete problems
constraint satisfaction problems
scheduling problem
phase transition
orders of magnitude
max sat
evolutionary algorithm
optimization problems
cellular automata
constraint programming
space complexity
hyper heuristics