#### Filter Results:

- Full text PDF available (161)

#### Publication Year

1983

2017

- This year (1)
- Last 5 years (41)
- Last 10 years (119)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Pao-Lien Lai, Jimmy J. M. Tan, Chien-Ping Chang, Lih-Hsing Hsu
- IEEE Trans. Computers
- 2005

Diagnosability has played an important role in the reliability of an interconnection network. The classical problem of fault diagnosis is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we introduce a new measure of diagnosability, called conditional diagnosability, by restricting that any faulty set… (More)

- Chien-Ping Chang, Ting-Yi Sung, Lih-Hsing Hsu
- IEEE Trans. Parallel Distrib. Syst.
- 2000

An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path… (More)

- Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu
- Inf. Process. Lett.
- 2002

It is known that every hypercube Qn is a bipartite graph. Assume that n 2 and F is a subset of edges with |F | n− 2. We prove that there exists a hamiltonian path in Qn − F between any two vertices of different partite sets. Moreover, there exists a path of length 2n − 2 between any two vertices of the same partite set. Assume that n 3 and F is a subset of… (More)

- Tseng-Kuei Li, Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu
- Inf. Process. Lett.
- 2003

A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to |V (G)| inclusive. It has been shown that Qn is bipancyclic if and only if n 2. In this paper, we improve this result by showing that every edge of Qn − E′ lies on a cycle of every even length from 4 to |V (G)| inclusive where E′ is a subset of E(Qn) with |E′| n− 2. The… (More)

- Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
- Inf. Sci.
- 2004

The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant… (More)

- Pao-Lien Lai, Jimmy J. M. Tan, Chang-Hsiung Tsai, Lih-Hsing Hsu
- IEEE Trans. Computers
- 2004

The classical problem of diagnosability is discussed widely and the diagnosability of many well-known networks have been explored. In this paper, we consider the diagnosability of a family of networks, called the Matching Composition Network (MCN); two components are connected by a perfect matching. The diagnosability of MCN under the comparison model is… (More)

- Guo-Huang Hsu, Chieh-Feng Chiang, Lun-Min Shih, Lih-Hsing Hsu, Jimmy J. M. Tan
- Journal of Systems Architecture - Embedded…
- 2009

Processor fault diagnosis plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Lai et al. proposed a novel measure of diagnosability, called conditional diagnosability, by adding an additional condition that any faulty set cannot contain all the neighbors of any… (More)

- Ming-Chien Yang, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu
- Inf. Process. Lett.
- 2003

The crossed cube CQn introduced by Efe has many properties similar to those of the popular hypercube. However, the diameter of CQn is about one half of that of the hypercube. Failures of links and nodes in an interconnection network are inevitable. Hence, in this paper, we consider the hybrid fault-tolerant capability of the crossed cube. Letting fe and fv… (More)

- Lih-Hsing Hsu, Peng-Fei Wang, Chu-Tao Wu
- Parallel Computing
- 1992

- Y-Chuang Chen, Jimmy J. M. Tan, Lih-Hsing Hsu, Shin-Shin Kao
- Applied Mathematics and Computation
- 2003

Let G 1⁄4 ðV ;EÞ be a k-regular graph with connectivity j and edge connectivity k. G is maximum connected if j 1⁄4 k, and G is maximum edge connected if k 1⁄4 k. Moreover, G is super-connected if it is a complete graph, or it is maximum connected and every minimum vertex cut is fxjðv; xÞ 2 Eg for some vertex v 2 V ; and G is super-edge-connected if it is… (More)