Constant time generation of free trees
SIAM Journal on Computing
Gray code sequences of partitions
Journal of Algorithms
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Gray code enumeration of families of integer partitions
Journal of Combinatorial Theory Series A
A Survey of Combinatorial Gray Codes
SIAM Review
Isomorph-free exhaustive generation
Journal of Algorithms
RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The advantages of forward thinking in generating rooted and free trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithm 371: Partitions in natural order [A1]
Communications of the ACM
Algorithm 263: Partition generator
Communications of the ACM
Efficient generation of plane trees
Information Processing Letters
Simple Combinatorial Gray Codes Constructed by Reversing Sublists
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
Constant Time Generation of Set Partitions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Constant time generation of trees with specified diameter
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating all distributions of objects to bins
International Journal of Computer Mathematics
Efficient enumeration of ordered trees with k leaves
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on “average.” Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time.