Efficient methods of constructing shorthand universal cycles for permutations (Q7230338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8187884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient methods of constructing shorthand universal cycles for permutations |
scientific article; zbMATH DE number 8187884 |
Statements
Efficient methods of constructing shorthand universal cycles for permutations (English)
0 references
17 April 2026
0 references
universal cycle
0 references
shorthand permutation
0 references
successor rule
0 references
cycle joining method
0 references
adjacency graph
0 references
0 references
0 references
