Affiliation:
1. Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel
Abstract
The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference9 articles.
1. Generation of permutations by adjacent transposition
2. Algorithm 115: Perm
3. EHRLm~ G. Four combinatoriM algorithms: PERMU. Permutations (to appear in Comm. A CM). COMBI: Combinations (to appear in Comm ACM). COMPOMIN: Compositions with minima (to appear in Comm. ACM). COMPOMAX: Compositions with maxima (to appear in Comm. A CM). See als~ PARTI' Part t ons of a set (m manuscript). GRAY2: Reflected binary Gray code (in manuscript). EHRLm~ G. Four combinatoriM algorithms: PERMU. Permutations (to appear in Comm. A CM). COMBI: Combinations (to appear in Comm ACM). COMPOMIN: Compositions with minima (to appear in Comm. ACM). COMPOMAX: Compositions with maxima (to appear in Comm. A CM). See als~ PARTI' Part t ons of a set (m manuscript). GRAY2: Reflected binary Gray code (in manuscript).
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献