Fast algorithms for generating integer partitions

International Journal of Computer Mathematics

Volumn 70, Issue 2, 1998, Pages 319-332

  Zoghbi, Antoine ^a   Stojmenović, Ivan ^b  

^a NORTEL NETWORKS   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Combinatorial objects; Integer partitions; Lexicographic order

Indexed keywords

MATHEMATICAL TECHNIQUES;

AVERAGE DELAY; COMBINATORIAL OBJECTS; EMPIRICAL TEST; FAST ALGORITHMS; INTEGER PARTITIONS; LEXICOGRAPHIC ORDER;

COMPUTER SCIENCE;

EID: 11744280037     PISSN: 00207160     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207169808804755     Document Type: Article

References (44)

1. Akl, S. G. (1981). A comparison of combination generation methods, ACM Trans. on Math. Software, 7(1), 42-45.
2. Akl. S. G. and Stojmenović, I. (1993). Parallel algorithms for generating integer partitions and compositions, J. of Combinatorial Mathematics and Combinatorial Computing, 13, 107-120.
3. Andrews, G. E. (1976). The theory of partitions, Addison-Wesley, Reading, Ma.
4. Belbaraka, M. and Stojmenović, I. (1944). On generating B-trees with constant average delay and in lexicographic order, Information Processing Letters, 49(1), 27-32.
5. Berge, C. (1971). Principles of Combinatorics, Academic Press.
6. Beyer, T. and Hedetniemi, S. M. (1980). Constant time generation of rooted trees, SIAM J. Comput., 9(4), 706-712.
7. Dickson, L. E. (1971). History of the theory of numbers, Vol. II, Diophantine Analysis, Chelsea Publishing Co., New York.
8. Djokic, B., Miyakawa, M., Sekiguchi, S., Semba, I. and Stojmenović, I. (1989). A fast algorithm for generating set partitions, The Computer J., 32(3), 281-282.
9. Fenner, T. I. and Loizou, G. (1980). A binary tree representation and related algorithms for generating integer partitions, The Computer J., 23(4), 332-337.
10. Fenner, T. I. and Loizou, G. (1983). Tree traversal related algorithms for generating integer partitions, SIAM J. Computing, 12(3), 551-564.
11. Fenner, T. I. and Loizou, G. (1981). An analysis of two related loop-free algorithms for generating integer partitions, Acta Informatica, 16, 237-252.
12. Gupta, U I., Lee, D T. and Wong, C. K. (1983). Ranking and unranking of B-trees, J. of Algorithms, 4, 51-60
13. Hardy, G. H. and Ramanujan, S. (1918). Asymptotic formulae in combinatorial analysis, Proc. London Math. Soc., 17, 237-252.
14. Hall, M. (1967). Combinatorial Theory, Blaisdell, Waltham, Mass.
15. Hikita, T. (1983). Listing and counting subtrees of equal size of a binary tree, Inf. Proc. Lett., 17, 225-229.
16. James, K. R. and Riha, W. (1976). Algorithm for generating graphs of a given partition, Computing, 16, 153-161.
17. Knuth, D. E. (1968). The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Ma.
18. Lehmer, D. H. (1964). The machine tools of combinatorics, In: Applied Combinatorial Mathematics, Beckenbach (Ed.), Wiley, NY.
19. Liu, C. L. (1968). Introduction to Combinatorial Mathematics, McGraw Hill.
20. McKay, J. K. S. (1965). Partition generator. Alg. 263, Comm. ACM, 8, 493.
21. McKay, J. K. S. (1965). Number of restricted partitions of n, Alg. 262, Comm. ACM, 8, 493.
22. McKay, J. K. S. (1965). Map of partitions into integers, Alg. 264, Comm. ACM, 8, 493.
23. McKay, J. K. S. (1970). Partitions in natural order, Alg. 371, Comm. ACM, 13, 52.
24. Narayana, T. V., Mathsen, R. M. and Saranji, J. (1971). An algorithm for generating partitions and its applications, J. Comb. Theory, 11, 54-61.
25. Nijenhius, A. and Wilf, H. S. (1975). Combinatorial Algorithms, Academic Press, NY.
26. Nijenhius, A. and Wilf, H. S. (1975). A method and two algorithms on the theory of partitions, J. Comb. Theory A, 18, 219-222.
27. Page, E. S. and Wilson, L. B. (1979). An Introduction to Computational Combinatorics, Cambridge Univ. Press.
28. Read, R. C. (1980). A survey of graph generation techniques, Lect. Notes in Math., 884, 77-89.
29. Riordan, J. (1958). An introduction to Combinatorial Analysis, John Wiley.
30. Reingold, E. M., Nievergelt. J. and Deo, N. (1977). Combinatorial Algorithms, Prentice Hall, Englewood Cliffs, New Jersey.
31. Riha, W. and James, K. R. (1976). Efficient algorithms for doubly and multiply restricted partitions, Algorithm 29, Computing, 16, 163-168.
32. Rubin, F. (1976). Partitions of integers, ACM Transactions on Mathematical Software, 2(4), 364-374.
33. Ruskey, F. (1978). Generating t-ary trees lexicographically, SIAM J. Comput., 7, 492-509.
34. Sanchis, L. (1992). Counting and generating integer partitions in parallel, Proc. Int. Conf. on Computing and Information ICCI'92, pp. 54-57.
35. Savage, C. D. (1989). Gray code sequences of partitions, J. of Alg., 10, 577-595.
36. Sedgewick, R. (1977). Permutation generation methods. Comp. Surv., 9, 137-164.
37. Stockmal, F. (1962). Generation of partitions in part-count form. Algorithm 95, Comm. ACM, 5, 344.
38. Tomasi, C. (1982). Two simple algorithms for the generation of partitions of an integer, Alta Frequenza, LI, 6, 352-356.
39. van Baronaigien, D. R. (1991). A loopless algorithm for generating binary tree sequences, information Processing Letters, 39, 189-194.
40. Wells, M. B. (1971). Elements of Combinatorial Computing, Pergamon Press, Oxford.
41. White, J. S. (1970). Restricted partition generator, Alg. 374, Comm. ACM, 13, 120.
42. White, J. S., Number of doubly restricted partitions, Alg. 373, ibid.
43. Zaks, S. and Richards, D. (1979). Generating trees and other combinatorial objects lexicograpically, SIAM J. on Comput., 8(1), 73-81.
44. Zoghbi, A. (1993). Algorithms for generating integer partitions, M. S. Thesis, University of Ottawa.