Shorthand universal cycles for permutations

DOI10.1007/s00453-011-9544-zzbMath1253.68273OpenAlexW2023800056MaRDI QIDQ1759661

Alexander E. Holroyd, Frank Ruskey, Aaron Williams

Publication date: 21 November 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9544-z

zbMATH Keywords

Cayley graphspermutohedronuniversal cyclesgray codesSP-cycles

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (17)

A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Enumerations of universal cycles for \(k\)-permutations ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Computing generalized de Bruijn sequences ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ On universal partial words ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ A new universal cycle for permutations ⋮ Unnamed Item ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Containing All Permutations ⋮ Gray codes and symmetric chains ⋮ Universal cycles for permutations ⋮ Sparse Kneser graphs are Hamiltonian ⋮ Shortened universal cycles for permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• Equivalence class universal cycles for permutations
• Faster Generation of Shorthand Universal Cycles for Permutations
• Doubly adjacent gray codes for the symmetric group
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Shorthand universal cycles for permutations