论文信息 - Loopless Algorithms And SchrÖder Trees

Loopless Algorithms And SchrÖder Trees

The generation of all members of a combinatorial family, such as permutations, partitions of an integer or binary trees with n nodes, has long been of interest in the computer science community. The development of loopless algorithms for such generation has been of more recent concern. This paper is an introduction to the idea and development of loopless algorithms. It illustrates the creation of a number of such algorithms, including multiset permutations, Gray codes and binary trees, and a new one for the generation of Schröder trees.

James F. Korsh | Paul LaFollette | Seymour Lipschutz

[1] T. C. Hu,et al. Generating Permutations with Nondistinct Items , 1976 .

[2] Selmer M. Johnson. Generation of permutations by adjacent transposition , 1963 .

[3] Doron Zeilberger,et al. A Classic Proof of a Recurrence for a Very Classical Sequence , 1997, J. Comb. Theory, Ser. A.

[4] James F. Korsh,et al. Generating Multiset Permutations in Constant Time , 1997, J. Algorithms.

[5] Richard P. Stanley,et al. Hipparchus, Plutarch, Schröder, and Hough , 1997 .

[6] Frank Ruskey,et al. On Rotations and the Generation of Binary Trees , 1993, J. Algorithms.

[7] James F. Korsh,et al. Shifts and Loopless Generation of k-Ary Trees , 1998, Inf. Process. Lett..

[8] Carla Savage,et al. A Survey of Combinatorial Gray Codes , 1997, SIAM Rev..

[9] Edward M. Reingold,et al. Efficient generation of the binary reflected gray code and its applications , 1976, CACM.

[10] Gideon Ehrlich,et al. Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations , 1973, JACM.