Partioning algorithms for finite sets
- 1 October 1963
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 6 (10) , 613-614
- https://doi.org/10.1145/367651.367661
Abstract
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 ).Keywords
This publication has 0 references indexed in Scilit: