An explicit universal cycle for the ( n -1)-permutations of an n -set

DOI10.1145/1798596.1798598zbMath1300.05305OpenAlexW2012661148WikidataQ60692573 ScholiaQ60692573MaRDI QIDQ2930325

Frank Ruskey, Aaron Williams

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1798596.1798598

zbMATH Keywords

loopless algorithmuniversal cycle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

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 ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ A new universal cycle for permutations ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Containing All Permutations ⋮ Shorthand universal cycles for permutations ⋮ Universal cycles of classes of restricted words ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Shortened universal cycles for permutations

This page was built for publication: An explicit universal cycle for the ( n -1)-permutations of an n -set