3 citations · 7 across the 13 of their papers we have counts for
1 paper · 1 filter
Aleksis Pirinen, Brendan Ames
As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the de…