"An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m ..."

Ichiro Semba (1984)

> Home

Details and statistics

DOI: 10.1016/0196-6774(84)90031-2

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Semba84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Semba84
Ichiro Semba:
An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order. J. Algorithms 5(2): 281-283 (1984)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.