论文信息 - A CAT algorithm for generating permutations with a fixed number of inversions

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

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.

Frank Ruskey | Scott Effler | F. Ruskey | Scott Effler

[1] Donald E. Knuth,et al. Dancing links , 2000, cs/0011047.

[2] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[3] Barbara Haas Margolius,et al. Permutations with Inversions , 2001 .

[4] Lane H. Clark,et al. An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions , 2000, Electron. J. Comb..

[5] Frank Ruskey,et al. Generating alternating permutations lexicographically , 1990, BIT Comput. Sci. Sect..

[6] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[7] Selim G. Akl. A new algorithm for generating derangements , 1980, BIT Comput. Sci. Sect..

[8] Frank Ruskey,et al. Generating Linear Extensions Fast , 1994, SIAM J. Comput..

[9] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[10] David Thomas,et al. The Art in Computer Programming , 2001 .

[11] Jim Davies,et al. Millennial Perspectives in Computer Science , 2000 .

[12] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[13] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .