Tung-Yang Ho

Learn More
TUNG-YANG HO, CHENG-KUAN LIN, JIMMY J. M. TAN, D. FRANK HSU AND LIH-HSING HSU Department of Information Management Ta Hwa Institute of Technology Hsinchu, 307 Taiwan E-mail: hoho@thit.edu.tw Department of Computer Science National Chiao Tung University Hsinchu, 300 Taiwan Department of Computer and Information Science Fordham University New York, NY 10023,(More)
Previous works on edge-fault tolerance with respect to hypercubes Qn are mainly focused on 1-edge fault and 2or 3edge fault with limited size of n. We give a construction scheme for 2-EFT(Qn) graphs and 3-EFT(Qn) graphs, where n is arbitrarily large. In our constructions, approximately log n extra degree is added to the vertices of Qn for 2-edge-fault(More)
Let P1 = 〈v1, v2, v3, . . . , vn〉 and P2 = 〈u1, u2, u3, . . . , un〉 be two hamiltonian paths of G. We say that P1 and P2 are independent if u1 = v1, un = vn , and ui = vi for 1 < i < n. We say a set of hamiltonian paths P1, P2, . . . , Ps of G between two distinct vertices are mutually independent if any two distinct paths in the set are independent. We use(More)
Fault-tolerant multiprocessors are widely used in on-line transaction processing. Fault tolerance is also desirable in massively parallel systems that have a relatively high failure probability. Two types of failures in a multiprocessor system are of interest, processor failures and link failures. Most of the previous research in designing optimal(More)
Fault-tolerant hamiltonicity and faulttolerant hamiltonian connectivity of the folded Petersen cube networks Cheng-Kuan Lin a , Tung-Yang Ho b , Jimmy J.M. Tan a & Lih-Hsing Hsu c a Department of Computer Science , National Chiao Tung University , Hsinchu, Taiwan, Republic of China b Department of Industrial Engineering and Management , Ta Hwa Institute of(More)
Ž . X Given a series-parallel network network, for short N, its dual network N is given by interchanging the series connection and the parallel connection of network N. We usually use a series-parallel graph to represent a network. Let w x w X x X G N and G N be graph representations of N and N , respectively. A sequence Ž w x w X x. of edges e , e , . . .(More)