#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh
- IEEE Trans. Computers
- 2002

- Cheng-Nan Lai, Gen-Huey Chen
- Networks
- 2008

- Cheng-Nan Lai, Gen-Huey Chen
- Theor. Comput. Sci.
- 2005

- Geng-Cyuan Jheng, Dyi-Rong Duh, Cheng-Nan Lai
- IJES
- 2010

- Cheng-Nan Lai
- Theor. Comput. Sci.
- 2012

Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m ≤ n. For general case, their maximal length is not… (More)

- Cheng-Nan Lai
- J. Parallel Distrib. Comput.
- 2015

- Cheng-Nan Lai
- J. Parallel Distrib. Comput.
- 2014

- Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh
- ISPAN
- 2000

- Dyi-Rong Duh, Yao-Chung Lin, Cheng-Nan Lai, Yue-Li Wang
- Theor. Comput. Sci.
- 2013

This work investigates 2RP-property of a generalized hypercube G. Given any four distinct vertices u, v, x and y in G, let l1 and l2 be two integers such that l1 (l2) is not less than the distance between u and v (x and y), and l1+l2 is equal to the number of vertices in G minus two. Then, there exist two vertex-disjoint paths P1 and P2 such that (1) P1 is… (More)

- Cheng-Nan Lai
- ICS
- 2014