Name
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 algorithms |
Year | DOI | Venue |
|---|---|---|
1979 | 10.1145/355826.355830 | ACM Trans. Math. Softw. |
Keywords | DocType | Volume |
loopless algorithms,pointers,binomial and multinomml,Combination Generators,hamiltonian circuits on the n-cube,combmatmns,constant-weight codes,permutatmns with repetitions permitted | Journal | 5 |
Issue | Citations | PageRank |
2 | 3 | 0.68 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| W. H. Payne | 1 | 111 | 95.42 |
| F. M. Ives | 2 | 10 | 8.10 |