On one problem of decomposing a set of interrelated elements into subsets

In design it is necessary to decompose a set of interrelated elements into maximally internally related blocks of a limited size. This problem is reduced to a variety of the socalled graph cutting problem, and is solved by a branch-and-bound algorithm whereby the edges are successively contracted.