Max-Cut Parameterized Above the Edwards-Erdős Bound

Robert Crowston Mark Jones Matthias Mnich

Published in: CoRR (2011)

Keyphrases

max cut
np hard
graph model
lower bound
upper bound
planar graphs
np complete problems
graph partitioning
worst case
genetic algorithm
pairwise
np complete
cellular automata
graph coloring