Channel graphs of bit permutation networks
檔案
- 000170245800014.pdf (106.4 KB, Adobe PDF)
日期
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.