A cost-optimal pipeline algorithm for permutation generation in lexicographic order

Journal of Parallel and Distributed Computing

Volumn 44, Issue 2, 1997, Pages 153-159

  Djamegni, Clémentin Tayou ^a   Tchuenté, Maurice ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031206079     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1347     Document Type: Article

References (7)

1. Akl S. G. Adaptive and optimal parallel algorithms for enumerating permutations and combinations. Comput. J. 30:1987;433-436.
2. Akl S. G., Meijer H., Stojmenovic I. An optimal systolic algorithm for generating permutations in lexicographic order. J. Parallel Distrib. Comput. 20:1994;84-91.
3. Lee W. P., Tsay J. C. A systolic design for generating permutations in lexicographic order. Parallel Comput. 20:1994;775-785.
4. Lehmer D. H. The machine tools of combinatorics. Applied Combinatorial Mathematics. 1964;Wiley, New York. p. 20-21.
5. Lin C. J. Parallel generation of permutations on systolic arrays. Parallel Comput. 15:1990;267-276.
6. Sedgewick R. Permutation generation methods. Comput. Surveys. 9:1977;137-164.
7. Reingold E. M. Combinatorial Algorithms: Theory and Practice. 1977;Prentice-Hall, Englewood Cliffs.