3 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Jan-Hendrik Lange
The NP-hard problem of correlation clustering is to partition a signed graph such that the number of conflicts between the partition and the signature of the graph is minimized. Th…