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

Information Processing Letters

Volumn 86, Issue 2, 2003, Pages 107-112

  Effler, Scott ^a   Ruskey, Frank ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Algorithms; Exhaustive listing; Index; Inversion; Permutation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; SORTING; TREES (MATHEMATICS);

CONSTANT AMORTIZED TIME (CAT);

INVERSE PROBLEMS;

EID: 0037473395     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00481-7     Document Type: Article

References (11)

1. Akl S.G. A new algorithm for generating derangements. BIT. 20:1980;2-7.
2. Bauslaugh B., Ruskey F. Generating alternating permutations lexicographically. BIT. 30:1990;17-26.
3. Clark L.A. An asymptotic expansion for the number of permutations with a certain number of inversions. Electron. J. Combin. 7:2000;#R50.
4. Knuth D.E. The Art of Computer Programming, Vol. 3: Sorting and Searching. 2nd edn. 1998;Addison-Wesley, Reading, MA.
5. Knuth D.E. The Art of Computer Programming, Vol. 4: Prefascicle 2B. January 2002.
6. Knuth D.E. Dancing links. Millennial Perspectives in Computer Science. 2000;187-214 Palgrave, Houndmills, Basingstoke, Hampshire.
7. Margolis B.H. Permutations with inversions. J. Integer Seq. 4:2001;. Article 01.2.4.
8. F. Ruskey, Combinatorial generation, Working version of book in progress, 1995-2002.
9. Pruesse G., Ruskey F. Generating linear extensions fast. SIAM J. Comput. 23:1994;373-386.
10. Roelants van Baronaigien D. Constant time generation of involutions. Proceedings of the 23rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992). Congr. Numer. 90:1992;87-96.
11. Walsh T. Loop-free sequencing of bounded integer compositions. J. Combin. Math. Combin. Comput. 33:2000;323-345.