Sign in
Some new hereditary classes where graph coloring remains NP-hard.
David Schindl
Published in:
Discret. Math. (2005)
Keyphrases
</>
graph coloring
remains np hard
combinatorial problems
job shop scheduling
np complete problems
constraint satisfaction problems
phase transition
max sat
np hard
scheduling problem
hyper heuristics
machine learning
search algorithm
computational complexity
lower bound