The local max-cut problem is PLS-complete even on graphs with maximum degree five

Tobias Tscheuschner

Published in: CoRR (2010)

Keyphrases

random graphs
max cut
partial least squares
graph theoretic
learning algorithm
similarity measure
directed graph
undirected graph
partial least squares regression
maximum likelihood
graph theory
graph structure