Thumbnail
Access Restriction
Subscribed

Author Hutchinson, George
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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).
Description Affiliation: ITT Communications, Inc., Paramus, NJ (Hutchinson, George)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 6
Issue Number 10
Page Count 2
Starting Page 613
Ending Page 614


Open content in new tab

   Open content in new tab
Source: ACM Digital Library