On a Greedy Algorithm to Construct Universal Cycles for Permutations

DOI10.1142/S0129054119400033zbMath1415.05002arXiv1711.10820WikidataQ128301736 ScholiaQ128301736MaRDI QIDQ5384431

Philip B. Zhang, Wolfgang Steiner, Sergey Kitaev, Alice L. L. Gao

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.10820

zbMATH Keywords

permutationsgreedy algorithmuniversal cyclescombinatorial generation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Permutations, words, matrices (05A05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Constructing the first (and coolest) fixed-content universal cycle ⋮ Shortened universal cycles for permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Universal cycles for permutations
• Universal cycles for combinatorial structures
• On shortening \(u\)-cycles and \(u\)-words for permutations
• Shorthand universal cycles for permutations
• Equivalence class universal cycles for permutations
• Hamiltonicity of digraphs for universal cycles of permutations
• Faster Generation of Shorthand Universal Cycles for Permutations
• A problem in arrangements

This page was built for publication: On a Greedy Algorithm to Construct Universal Cycles for Permutations