Login / Signup

An upper bound for the chromatic number of a graph and its application to timetabling problems.

D. J. A. WelshM. B. Powell
Published in: Comput. J. (1967)
Keyphrases
  • upper bound
  • artificial intelligence
  • constant factor
  • objective function
  • control system
  • special case
  • worst case