Unranking Small Combinations of a Large Set in Co-Lexicographic Order
The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey’s algorithm for unranking <i>m</i>-combinations of an <i>n</i>-set in co-lexicographic order. The proposed modification is based...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
MDPI AG
2022-01-01
|
| シリーズ: | Algorithms |
| 主題: | |
| オンライン･アクセス: | https://www.mdpi.com/1999-4893/15/2/36 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|