MAX CUT in cubic graphs.

Eran Halperin Dror Livnat Uri Zwick

Published in: J. Algorithms (2004)

Keyphrases

max cut
graph model
planar graphs
np hard
np complete problems
graph partitioning
min max
spectral graph
np complete
image segmentation
pairwise
phase transition
greedy heuristic