More Restricted Growth Functions: Gray Codes and Exhaustive Generation - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Graphs and Combinatorics Année : 2017

More Restricted Growth Functions: Gray Codes and Exhaustive Generation

Résumé

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.
Fichier non déposé

Dates et versions

hal-01552981 , version 1 (03-07-2017)

Identifiants

Citer

Ahmad Sabri, Vincent Vajnovszki. More Restricted Growth Functions: Gray Codes and Exhaustive Generation. Graphs and Combinatorics, 2017, 33 (3), pp.573 - 582. ⟨10.1007/s00373-017-1774-7⟩. ⟨hal-01552981⟩
64 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More