Clique partitionning in Euclidean space Rⁿ consists in finding a partition of a given set of N points into M clusters in order to minimize the sum of within-cluster interpoint distances. For n = 1 clusters need not consist of consecutive points on a line but have a nestedness property. Exploiting this property, an O (N⁵ M²) dynamic programming algorithm is proposed. A (N) algorithm is also given for the case M = 2.