Max-cut in circulant graphs.

Svatopluk Poljak Daniel Turzík

Published in: Discret. Math. (1992)

Keyphrases

max cut
graph model
planar graphs
graph partitioning
np complete problems
np hard
spectral graph
least squares
np complete
data clustering
graph coloring
min max
scheduling problem
special case
similarity measure
multiscale
bayesian networks