Abstract
The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.
| Original language | English |
|---|---|
| Pages (from-to) | 500-513 |
| Number of pages | 14 |
| Journal | Journal of the ACM |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jul 1973 |
| Externally published | Yes |
Keywords
- Gray code
- algorithm
- combinations
- compositions
- generating
- iff program
- listing
- loopless algorithims
- ordering
- partitions
- permutations
Fingerprint
Dive into the research topics of 'Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver