| Title: | SOME DIRECTED GRAPH THEOREMS FOR TESTING THE DYNAMIC FULL ACCESS PROPERTY OF MULTISTAGE INTERCONNECTION NETWORKS |
| Authors: | LEE, TH CHOU, JJ 電信工程研究所 Institute of Communications Engineering |
| Issue Date: | 1993 |
| URI: | http://hdl.handle.net/11536/20254 |
| ISBN: | 7-80003-285-X |
| Journal: | TENCON '93: 1993 IEEE REGION 10 CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND POWER ENGINEERING, VOL 1 |
| Begin Page: | 217 |
| End Page: | 220 |
| Appears in Collections: | Conferences Paper |
- TESTING THE DYNAMIC FULL ACCESS PROPERTY OF A CLASS OF MULTISTAGE INTERCONNECTION NETWORKS / LEE, TH;CHOU, JJ
- Equivalence of buddy networks with arbitrary number of stages / Chen, CY;Hwang, FK;Lan, JK
- A fault-tolerant multistage combining network / Lu, NP;Chung, CP
- Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks / Hwang, FK;Yen, CH
- On noninterruptive rearrangeable networks / Hwang, Frank K.;Lin, Wen-Dar;Lioubimov, Vadim
- Designing a disjoint paths interconnection network with fault tolerance and collision solving / Chen, CW;Chung, CP
Loading...