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

Khodakhast Bibak Bruce M. Kapron Venkatesh Srinivasan

Published in: Discret. Math. (2019)

Keyphrases

graph theoretic
significant improvement
similarity measure
preprocessing
dynamic programming
detection method
high precision
experimental evaluation
clustering method
objective function
computational complexity
cost function
parameter estimation
classification method