An optimal parallel algorithm for generating permutations in minimal change order

Authors:
Jong-Chuang Tsay;Wei-Ping Lee
Affiliations:
-;-
Venue:
Parallel Computing
Year:
1994

Citing 4
Cited 0

Parallel generation of permutations and combinations

BIT
Adaptive and optimal parallel algorithms for enumerating permutations and combinations

The Computer Journal
Permutation Generation Methods

ACM Computing Surveys (CSUR)
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 processors. Because of the simplicity and regularity of the processors, the model is very suitable for VLSI implementation. Another advantageous characteristic of this design is that it can generate all the permutations in minimal change order.