Bounds on spectrum graph coloring.
David OrdenIvan Marsá-MaestreJosé Manuel Giménez-GuzmánEnrique de la HozPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- phase transition
- np complete problems
- scheduling problem
- lower bound
- constraint satisfaction problems
- upper bound
- max sat
- worst case
- constraint satisfaction
- hyper heuristics
- artificial bee colony
- np hard
- traveling salesman problem
- constraint programming
- optimization algorithm
- genetic programming