AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER

被引：2
|
作者：
TSAY, JC
LEE, WP
机构：
[1] Institute of Computer Science and Information Engineering, College of Engineering, National Chiao Tung University, Hsinchu
来源：
PARALLEL COMPUTING | 1994年 / 20卷 / 03期
关键词：
MINIMAL CHANGE ORDER; PARALLEL ALGORITHM; PERMUTATION GENERATION; VLSI;
D O I：
10.1016/S0167-8191(06)80018-9
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：353 / 361
页数：9
相关论文
共 50 条
12345