6533b85bfe1ef96bd12ba98e
RESEARCH PRODUCT
An efficient Gray code algorithm for generating all permutations with a given major index
Vincent Vajnovszkisubject
Discrete mathematicsCombinatoricsGray codeComputational Theory and MathematicsDiscrete Mathematics and CombinatoricsMajor indexAlgorithmTheoretical Computer ScienceMathematicsdescription
Abstract 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.
year | journal | country | edition | language |
---|---|---|---|---|
2014-05-01 | Journal of Discrete Algorithms |