On a graph correlation clustering problem
In the paper, we consider a graph correlation clustering problem, also knownunder the name of the graph approximation problem. For the graph correlation clustering problem, in which the number of clusters does not exceed three, two polynomial time approximation algorithms are proposed. We present the results of an experimental study of these algorithms.