Login / Signup
MAX CUT in cubic graphs.
Eran Halperin
Dror Livnat
Uri Zwick
Published in:
SODA (2002)
Keyphrases
</>
max cut
graph model
np hard
graph partitioning
np complete problems
planar graphs
spectral graph
np complete
special case
social networks
computational complexity
lower bound
evolutionary algorithm
random walk
phase transition