AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

1994-03-01

類型

期刊名稱

PARALLEL COMPUTING

卷期與頁次

第 20 卷,頁 353–361

ISSN

0167-8191

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

TSAY, J., & LEE, W. (1994). AN OPTIMAL PARALLEL ALGORITHM FOR GENERATING PERMUTATIONS IN MINIMAL CHANGE ORDER. PARALLEL COMPUTING, 20, 353–361. https://doi.org/10.1016/S0167-8191(06)80018-9

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/149114