An exact algorithm for MAX-CUT in sparse graphs.

Federico Della Croce Marcin Jakub Kaminski Vangelis Th. Paschos

Published in: Oper. Res. Lett. (2007)

Keyphrases

max cut
graph model
planar graphs
graph partitioning
np hard
np complete problems
spectral graph
branch and bound algorithm
special case
approximation algorithms
integer programming
column generation
image segmentation
data clustering
weighted graph