Partitioning Algorithms for Finite Sets

The partitions of a set with n elements are represented
by certain n-tuples of positive integers. 
 Algorithm 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).

CACM October, 1963

Hutchinson, G.

CA631008 JB March 13, 1978  5:57 PM

717	5	717
717	5	717
717	5	717