Shorthand universal cycles for permutations
type: Item
instance of: scholarly article
title: Shorthand universal cycles for permutations
zbMATH Open document ID: 1253.68273
author: A. E. Holroyd
author: Frank Ruskey
author: Aaron Williams
published in: Algorithmica
publication date: 2012-11-21T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 6109323
zbMATH Keywords: universal cycles
zbMATH Keywords: SP-cycles
zbMATH Keywords: gray codes
zbMATH Keywords: Cayley graphs
zbMATH Keywords: permutohedron
MaRDI profile type: Publication
full work available at URL: s00453-011-9544-z
OpenAlex ID: W2023800056
cites work: Universal cycles for combinatorial structures
cites work: Doubly adjacent gray codes for the symmetric group
cites work: Q3651735
cites work: Faster Generation of Shorthand Universal Cycles for Permutations
cites work: Equivalence class universal cycles for permutations
cites work: Universal cycles for permutations
cites work: Generation of Permutations by Adjacent Transposition
cites work: Q4681162
cites work: An explicit universal cycle for the ( n -1)-permutations of an n -set
cites work: Q4133641
DOI: 10.1007/S00453-011-9544-Z
description: scientific article; zbMATH DE number 6109323