A note on combination generators

Authors:
C. T. Gan
Affiliations:
University of Edinburgh, Block 631, Bedock Reservoir Road, #03-952, Singapore 1647
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1985

Citing 3
Cited 0

A Comparison of Combination Generation Methods

ACM Transactions on Mathematical Software (TOMS)
Algorithm 154: combination in lexicographical order

Communications of the ACM
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recent study by Akl indicates that Mifsud's algorithm, which involves unnecessary searching operations, is the fastest existing combination generator. A modified Page and Wilson's algorithm, which is essentially similar to Mifsud's algorithm, is presented. A theoretical analysis of the modified algorithm is also given.