A note on the complexity of longest path problems related to graph coloring.

Panos M. Pardalos Athanasios Migdalas

Published in: Appl. Math. Lett. (2004)

Keyphrases

graph coloring
combinatorial problems
np complete problems
decision problems
examination timetabling
job shop scheduling
optimization problems
constraint satisfaction problems
hyper heuristics
computational complexity
search space
traveling salesman problem
benchmark problems
difficult problems