Login / Signup

Relaxed approximate coloring in exact maximum clique search.

Pablo San SegundoCristóbal Tapia
Published in: Comput. Oper. Res. (2014)
Keyphrases
  • maximum clique
  • search algorithm
  • approximate matches
  • search space
  • constraint satisfaction problems
  • branch and bound algorithm
  • information retrieval
  • optimal solution
  • user queries