An optimal parallel algorithm for genera
โ
Jong-Chuang Tsay; Wei-Ping Lee
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 430 KB
Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo