A generalization of Schönemann's theorem via a graph theoretic method.

Khodakhast Bibak Bruce M. Kapron Venkatesh Srinivasan

Published in: CoRR (2017)

Keyphrases

graph theoretic
clustering method
detection method
similarity measure
cost function
experimental evaluation
classification method
preprocessing
synthetic data
high accuracy
computational cost
dynamic programming
significant improvement
high precision
graph theory
pairwise
maximum independent set