Sign in

Complexity and Heuristics for the Max Cut-Clique Problem.

Mathias BourelEduardo Alberto CanaleFranco RobledoPablo RomeroLuis Stábile
Published in: ICVNS (2018)
Keyphrases
  • max cut
  • search algorithm
  • graph model
  • computational complexity
  • image segmentation
  • search space
  • np hard
  • worst case
  • search strategies
  • planar graphs
  • np complete problems