Login / Signup
A Simple MAX-CUT Algorithm for Planar Graphs.
Frauke Liers
G. Pardella
Published in:
CTW (2009)
Keyphrases
</>
max cut
planar graphs
computational complexity
graph model
np hard
k means
probabilistic model
worst case
np complete
spectral graph
optimal solution
special case
parameter estimation
convex hull
bayesian framework
np complete problems