Consider a set O of N entities and a matrix D = (d_k ) of dissimilarities between pairs of entities {O_k, O} of O. The split of a subset (or cluster) C of O is the minimum dissimilarity between an entity of C and one of O C. A (N²) algorithm is proposed for finding a maximum split cluster C of m entities for all m = 1,2,...,N - 1.