More Restricted Growth Functions: Gray Codes and Exhaustive Generation

Abstract : A Gray code for a combinatorial class is a method for listing the objects in the class so that successive objects differ in some prespecified, small way, typically expressed as a bounded Hamming distance. In a previous work, the authors of the present paper showed, among other things, that the m-ary Reflected Gray Code Order yields a Gray code for the set of restricted growth functions. Here we further investigate variations of this order relation, and give the first Gray codes and efficient generating algorithms for bounded restricted growth functions.
Liste complète des métadonnées

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01552981
Contributeur : Le2i - Université de Bourgogne <>
Soumis le : lundi 3 juillet 2017 - 12:51:30
Dernière modification le : mardi 6 février 2018 - 15:56:16

Identifiants

Collections

Citation

Ahmad Sabri, Vincent Vajnovszki. More Restricted Growth Functions: Gray Codes and Exhaustive Generation. Graphs and Combinatorics, Springer Verlag, 2017, 33 (3), pp.573 - 582. 〈https://link.springer.com/article/10.1007%2Fs00373-017-1774-7〉. 〈10.1007/s00373-017-1774-7〉. 〈hal-01552981〉

Partager

Métriques

Consultations de la notice

74