Research and Advances

Partioning algorithms for finite sets

The partitions of a set with n elements are represented by certain n-tuples of positive integers. Algorithms are described which generate without repetitions the n-tuples corresponding to: (1) all partitions of the given set, (2) all partitions of the given set into m or fewer sets (1 ≨ m ≨ n), and (3) all partitions of the given set into exactly m sets (1 ≨ m ≨ n).

Advertisement

Author Archives

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved