公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
2002 | Constructing One-to-Many Disjoint Paths in Folded Hypercubes. | Lai, Cheng-Nan; Chen, Gen-Huey; Duh, Dyi-Rong; GEN-HUEY CHEN | IEEE Trans. Computers | | | |
2000 | Optimal One-to-Many Disjoint Paths in Folded Hypercubes. | Lai, Cheng-Nan; Chen, Gen-Huey; Duh, Dyi-Rong; GEN-HUEY CHEN | 5th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2000), 7-10 December 2000, Dallas / Richardson, TX, USA | | | |
2000 | Routing Functions-an Effective Approach to Deriving One-to-Many Disjoint Paths | Lai, Cheng-Nan; Chen, Gen-Huey ; Duh, Dyi-Rong | | | | |
2005 | Strong Rabin numbers of folded hypercubes | Lai, Cheng-Nan; Chen, Gen Huey | Theoretical Computer Science | 13 | 13 | |