66 citations · 91 across the 13 of their papers we have counts for
1 paper · 1 filter
Brendan P. W. Ames, Stephen A. Vavasis
We consider the k-disjoint-clique problem. The input is an undirected graph G in which the nodes represent data items, and edges indicate a similarity between the corresponding ite…