Login / Signup

NP-completeness of a family of graph-colouring problems.

Robert W. Irving
Published in: Discret. Appl. Math. (1983)
Keyphrases
  • graph colouring
  • bin packing
  • round robin
  • optimization problems
  • tabu search
  • combinatorial problems
  • artificial neural networks
  • upper bound
  • linear programming
  • np complete
  • benchmark problems