Complexity and Heuristics for the Max Cut-Clique Problem.

Mathias Bourel Eduardo Alberto Canale Franco Robledo Pablo Romero Luis 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