Faster generation of shorthand universal cycles for permutations

DOI10.1007/978-3-642-14031-0_33MaRDI QIDQ3578329zbMATH OpenOpenAlexFDO

Authors A. E. Holroyd, Frank Ruskey, 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

bell ringerscircular stringfull rotationsnew algorithmic constructionspermutationsshift Gray codeshorthandsuccessive blocksuniversal cycle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• A new universal cycle for permutations
• Shorthand universal cycles for permutations
• Universal cycles of k-subsets and k-permutations
• Universal cycles for permutations
• Universal cycles for combinatorial structures

Cited in

(8)

• A new universal cycle for permutations
• Shorthand universal cycles for permutations
• Shortened universal cycles for permutations
• Enumerations of universal cycles for \(k\)-permutations
• Containing all permutations
• On a greedy algorithm to construct universal cycles for permutations
• Efficient methods of constructing shorthand universal cycles for permutations
• Efficient universal cycle constructions for k-permutations via concatenation trees

This page was built for publication: Faster generation of shorthand universal cycles for permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578329)