Combination Generators
- 1 June 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 5 (2) , 163-172
- https://doi.org/10.1145/355826.355830
Abstract
The Liu-Tang combmatmn enumeratmn algonthm produces a cychc sequence of combinations. Each combination is obtained from Its predecessor by a single exchange of two marks. History of the sequence does not need to be known to generate the next comblnatmn. A pointer programmed versmn of the Lm-Tang algorithm greatly improves speed of execution compared to the original coding when K or N - K Is small as they appear m ~). This implementation was rated with respect to advantageous attributes and compared favorably with several other combination enumeratmn algorithmsKeywords
This publication has 10 references indexed in Scilit:
- Efficient generation of the binary reflected gray code and its applicationsCommunications of the ACM, 1976
- Algorithm 466: four combinatorial algorithm [G6]Communications of the ACM, 1973
- Algorithm 452: enumerating combinations of m out of n objects [G6]Communications of the ACM, 1973
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial ConfigurationsJournal of the ACM, 1973
- Algorithm 382: combinations of M out of N objects [G6]Communications of the ACM, 1970
- Algorithm 383: permutations of a set with repetitions [G6]Communications of the ACM, 1970
- Algorithm 306: permutations with repetitionsCommunications of the ACM, 1967
- Algorithm 242: Permutations of a set with repetitionsCommunications of the ACM, 1964
- Algorithm 154: combination in lexicographical orderCommunications of the ACM, 1963
- Algorithm 94: CombinationCommunications of the ACM, 1962