A CAT algorithm for generating permutations with a fixed number of inversions
From MaRDI portal
Publication:1007583
DOI10.1016/S0020-0190(02)00481-7zbMATH Open1173.68587MaRDI QIDQ1007583FDOQ1007583
Authors: Scott Effler, Frank Ruskey 
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Cites Work
- Linear probing and graphs
- Generating Linear Extensions Fast
- Generating alternating permutations lexicographically
- An asymptotic expansion for the number of permutations with a certain number of inversions
- Permutations with inversions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new algorithm for generating derangements
Cited In (11)
- An efficient Gray code algorithm for generating all permutations with a given major index
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- Restricted compositions and permutations: from old to new Gray codes
- Algorithmic combinatorics based on slicing posets
- Gray code for derangements
- Gray code for permutations with a fixed number of cycles
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Generating restricted classes of involutions, Bell and Stirling permutations
- More restrictive Gray codes for some classes of pattern avoiding permutations
This page was built for publication: A CAT algorithm for generating permutations with a fixed number of inversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007583)
