Gray codes, loopless algorithm and partitions
type: Item
instance of: scholarly article
title: Gray codes, loopless algorithm and partitions
zbMATH Open document ID: 1180.68296
author: Toufik Mansour
author: Ghalib Nassar
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2009-11-25T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A17
Mathematics Subject Classification ID: 94B15
zbMATH DE Number: 5638520
zbMATH Keywords: combinatorial algorithm
zbMATH Keywords: loopless algorithm
zbMATH Keywords: combinatorial Gray code
zbMATH Keywords: generating partitions
MaRDI profile type: Publication
full work available at URL: s10852-008-9086-9
OpenAlex ID: W2081454722
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: On \(abab\)-free and \(abba\)-free set partitions
cites work: Generating permutations of a bag by interchanges
cites work: Loopless Generation of Trees with Specified Degrees
cites work: Generating Multiset Permutations in Constant Time
cites work: Generating permutations with given ups and downs
cites work: Adjacent interchange generation of combinations
cites work: Q4325282
cites work: Q4344108
cites work: Q3726126
cites work: Q4511229
cites work: A loopless algorithm for generating the permutations of a multiset
cites work: Gray codes for involutions
DOI: 10.1007/S10852-008-9086-9
Recommended article: Gray code sequences of partitions
Recommended article: Loop-free Gray code algorithms for the set of compositions
Recommended article: A Gray code for set partitions
Recommended article: Gray code enumeration of families of integer partitions
Recommended article: Gray codes for noncrossing and nonnesting partitions of classical types
Recommended article: Q3077261
Recommended article: Gray codes for non-crossing partitions and dissections of a convex polygon
Recommended article: Q4318151
Recommended article: Q4016807
Recommended article: A loopless implementation of a gray code for signed permutations
description: scientific article; zbMATH DE number 5638520