Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
type: Item
instance of: scholarly article
title: Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
zbMATH Open document ID: 1260.68448
author: Toufik Mansour
author: Ghalib Nassar
author: Vincent Vajnovszki
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05A18
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 6149223
zbMATH Keywords: combinatorial problems
zbMATH Keywords: Gray codes
zbMATH Keywords: loop-free algorithms
zbMATH Keywords: partitions
zbMATH Keywords: e-restricted growth functions
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.03.006
OpenAlex ID: W2087998687
cites work: Gray code for permutations with a fixed number of cycles
cites work: Gray code for derangements
cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
cites work: Generation of Permutations by Adjacent Transposition
cites work: Q5585020
cites work: On Rotations and the Generation of Binary Trees
cites work: Gray codes, loopless algorithm and partitions
cites work: Loop-free Gray code algorithms for the set of compositions
cites work: Q4325282
cites work: Q3726126
cites work: On the loopless generation of binary tree sequences
cites work: A loopless algorithm for generating the permutations of a multiset
cites work: Gray codes for involutions
cites work: Q4452089
DOI: 10.1016/J.IPL.2011.03.006
description: scientific article; zbMATH DE number 6149223