We study here a CSP decomposition method introduced in [9] and called Cyclic-Clustering. While [9] only presents the principles of the method, this paper explains how this method can be made operational by exploiting good properties of triangulated induced subgraphs. After, we give formal results which show that Cyclic-Clustering proposes a time-space trade-off w.r.t. theoretical complexities. Finally, we present some preliminary experiments which show that Cyclic-Clustering may be efficient in practice.