A new universal cycle for permutations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7051269 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- An explicit universal cycle for the (n-1)-permutations of an n-set
- Faster generation of shorthand universal cycles for permutations
- Shorthand universal cycles for permutations
- Universal cycles for combinatorial structures
- Universal cycles for permutations
- Universal cycles of k-subsets and k-permutations
Cited in
(10)- scientific article; zbMATH DE number 1811347 (Why is no real title available?)
- Efficient enumeration of cyclic permutations in situ
- Constructing the first (and coolest) fixed-content universal cycle
- Shorthand universal cycles for permutations
- A cycle lemma for permutation inversions
- An explicit universal cycle for the (n-1)-permutations of an n-set
- Faster generation of shorthand universal cycles for permutations
- On a greedy algorithm to construct universal cycles for permutations
- Shortened universal cycles for permutations
- Enumerations of universal cycles for \(k\)-permutations
This page was built for publication: A new universal cycle for permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696522)