標題: | AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER |
作者: | TSAY, JC LEE, WP 資訊工程學系 Department of Computer Science |
關鍵字: | MINIMAL CHANGE ORDER;PARALLEL ALGORITHM;PERMUTATION GENERATION;VLSI |
公開日期: | 1-三月-1994 |
摘要: | 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. |
URI: | http://dx.doi.org/10.1016/S0167-8191(06)80018-9 http://hdl.handle.net/11536/149114 |
ISSN: | 0167-8191 |
DOI: | 10.1016/S0167-8191(06)80018-9 |
期刊: | PARALLEL COMPUTING |
Volume: | 20 |
起始頁: | 353 |
結束頁: | 361 |
顯示於類別: | 期刊論文 |