Fenner, Trevor and Loizou, G. (1983) Tree traversal related algorithms for generating integer partitions. SIAM Journal on Computing 12 (3), pp. 551-564. ISSN 0097-5397.
Abstract
We define and characterize orderings of the set of partitions of a positive integer n obtained by traversing the binary tree of the set of partitions of n in each of the three principal orders. Loop-free algorithms for generating the set of partitions in each of these three orders and also in the three corresponding reverse orders are derived. The asymptotic behaviour of each of these six algorithms is examined and compared.
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 23 Mar 2021 19:43 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43634 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
