Name
Abstract | ||
|---|---|---|
In this paper we give a simple algorithm to generate all partitions of {1, 2, ..., n} into k non-empty subsets. The number of such partitions is known as the Stirling number of the second kind. The algorithm generates each partition in constant time without repetition. By choosing k = 1, 2, ..., n we can also generate all partitions of {1, 2, ..., n} into subsets. The number of such partitions is known as the Bell number. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1093/ietfec/e88-a.4.930 | IEICE Transactions |
Keywords | Field | DocType |
constant time generation,set partitions,bell number,constant time,k non-empty subsets,stirling number,simple algorithm | Discrete mathematics,Combinatorics,Bell number,Enumeration,Gray code,Partition of a set,Bell polynomials,SIMPLE algorithm,Partition (number theory),Stirling numbers of the second kind,Mathematics | Journal |
Volume | Issue | ISSN |
E88-A | 4 | 0916-8508 |
Citations | PageRank | References |
9 | 0.62 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shin-Ichiro Kawano | 1 | 14 | 1.60 |
| Shin-ichi Nakano | 2 | 246 | 24.40 |