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

Robert Crowston Mark Jones Matthias Mnich

Published in: Algorithmica (2015)

Keyphrases

max cut
np hard
graph model
lower bound
planar graphs
upper bound
graph partitioning
np complete problems
worst case
spectral graph
np complete
computational complexity
special case
spectral clustering
min max
theoretic framework