A CAT algorithm for generating permutations with a fixed number of inversions

Authors:
Scott Effler;Frank Ruskey
Affiliations:
Department of Computer Science, University of Victoria, Canada;Department of Computer Science, University of Victoria, Canada
Venue:
Information Processing Letters
Year:
2003

Citing 4
Cited 6

Generating alternating permutations lexicographically

BIT
Generating Linear Extensions Fast

SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

Gray code for derangements

Discrete Applied Mathematics
A loopless Gray code for rooted trees

ACM Transactions on Algorithms (TALG)
Algorithmic combinatorics based on slicing posets

Theoretical Computer Science
More restrictive Gray codes for some classes of pattern avoiding permutations

Information Processing Letters
Generating restricted classes of involutions, Bell and Stirling permutations

European Journal of Combinatorics
Restricted compositions and permutations: From old to new Gray codes

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.