Channel graphs of bit permutation networks

檔案

日期

2001-07-28

期刊名稱

THEORETICAL COMPUTER SCIENCE

卷期與頁次

第 263 卷第 1-2 期,頁 139–143

ISSN

0304-3975

語言

英文

摘要

Channel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit pen-nutation network has a unique channel graph if and only if it is connected, and two connected bit pen-nutation networks are isomorphic if and only if their channel graphs are isomorphic. (C) 2001 Elsevier Science B.V. All rights reserved.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Tong, L., Wang, F., & Chang, G. (2001). Channel graphs of bit permutation networks. THEORETICAL COMPUTER SCIENCE, 263(1-2), 139–143. https://doi.org/10.1016/S0304-3975(00)00237-1

BibTeX RIS

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

分享

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