An efficient algorithm for generating all k-subsets (1 ⩽ k ⩽ m ⩽ n) of the set [1, 2,…, n] in lexicographical order
Ichiro SembaVolume:
5
Year:
1984
Language:
english
Pages:
3
DOI:
10.1016/0196-6774(84)90031-2
File:
PDF, 127 KB
english, 1984