Login / Signup
max-cut and containment relations in graphs.
Marcin Kaminski
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
max cut
graph model
planar graphs
np complete problems
np hard
spectral graph
graph partitioning
np complete
data objects
theoretic framework
graphical models
data clustering
metric learning
min max