Faster Generation of Shorthand Universal Cycles for Permutations

DOI10.1007/978-3-642-14031-0_33zbMath1253.05008OpenAlexW1595387747MaRDI QIDQ3578329

Frank Ruskey, Alexander E. Holroyd, Aaron Williams

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_33

zbMATH Keywords

permutationsuniversal cycleshift Gray codesuccessive blockscircular stringbell ringersfull rotationsnew algorithmic constructionsshorthand

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (4)

A new universal cycle for permutations ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Containing All Permutations ⋮ Shorthand universal cycles for permutations

This page was built for publication: Faster Generation of Shorthand Universal Cycles for Permutations