An efficient Gray code algorithm for generating all permutations with a given major index

详细信息    查看全文

• 作者：Vincent Vajnovszki ^{vvajnov@u-bourgogne.fr" class="auth_mail}
• 关键词：Generating algorithms permutations ; (Bounded) compositions of an integer ; Major index
• 刊名：Journal of Discrete Algorithms
• 出版年：May 2014
• 年：2014
• 卷：26
• 期：Complete
• 页码：77-88
• 全文大小：301 K

文摘

In Effler and Ruskey (2003) [1] the authors give an algorithm, which appears to be CAT, for generating permutations with a given major index. In the present paper we give a new algorithm for generating a Gray code for subexcedant sequences. We show that this algorithm is CAT and modify it into a CAT generating algorithm for a Gray code for permutations with a given major index.