Three new combination algorithms with the minimal change property

Authors:
Clement W. H. Lam;Leonard H. Soicher
Affiliations:
Concordia Univ., Montreal, Quebec, Canada;Univ. of Cambridge, Cambridge, England
Venue:
Communications of the ACM
Year:
1982

Citing 5
Cited 1

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Journal of the ACM (JACM)
Permutation enumeration: four new permutation algorithms

Communications of the ACM
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
Algorithm 466: four combinatorial algorithm [G6]

Communications of the ACM
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Some Hamilton Paths and a Minimal Change Algorithm

Journal of the ACM (JACM)

Quantified Score

Hi-index	48.22

Visualization

Abstract