Improved Bounds on the Complexity of Graph Coloring.

Zoltán Ádám Mann Aniko Szajko

Published in: SYNASC (2010)

Keyphrases

graph coloring
combinatorial problems
worst case
upper bound
max sat
job shop scheduling
np complete problems
lower bound
phase transition
hyper heuristics
scheduling problem
computational complexity
genetic programming
constraint satisfaction problems
constraint programming
space complexity