#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Chang-Hsiung Tsai, Jheng-Cheng Chen
- Theor. Comput. Sci.
- 2013

- Jheng-Cheng Chen, Chang-Hsiung Tsai
- Inf. Sci.
- 2011

- Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai, Pao-Lien Lai
- Applied Mathematics and Computation
- 2013

The crossed cube proposed by Efe is one of the most notable variations of the hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half that of the hypercube. In this paper, we consider the problem of embedding a Hamiltonian cycle passing through a prescribed edge in… (More)

- Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai
- 2011 14th IEEE International Conference on…
- 2011

Problem diagnosis in large distributed computer systems and networks is a challenging task that requires fast and accurate inferences from huge data volumes. In this paper, the PMC diagnostic model are considered and the diagnosis approach in this model is based on end-to-end probing technology. A probe is a test transaction whose outcome depends on some of… (More)

- Jheng-Cheng Chen, Chia-Jui Lai, Chang-Hsiung Tsai
- FSKD
- 2011

Problem diagnosis in large distributed computer systems and networks is a challenging task that requires fast and accurate inferences from huge data volumes. In this paper, the PMC diagnostic model are considered and the diagnosis approach in this model is based on end-to-end probing technology. A probe is a test transaction whose outcome depends on some of… (More)

The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We… (More)

- Chia-Jui Lai, Jheng-Cheng Chen, Chang-Hsiung Tsai
- Inf. Sci.
- 2014

A set of subgraphs C1, C2, . . . , Ck in a graph G is said to identify the vertices if the sets {j | v ∈ Cj} are nonempty for all the vertices v and no two are the same set. We consider the problem of minimizing k when the subgraphs Ci are required to be cycles. The motivation comes from fault diagnosis of multiprocessor systems. We study the cases when G… (More)

Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to embed a family of disjoint 2D meshes into a Möbius cube. Two major contributions of this paper are: (1) For n ≥ 1, there exists a 2 × 2 mesh that can be embedded in the n-dimensional Möbius cube with dilation 1 and expansion 1. (2) For n ≥ 4, there are two… (More)

For two vertices X,Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shortest path joining X and Y lies on the cycle. A graph G is called to be geodesic k-pancyclic if any two vertices X,Y on G have such geodesic cycle of length l that 2dG(X,Y ) + k ≤ l ≤ |V (G)|. In this paper, we show that the n-dimensional Möbius cube MQn is geodesic… (More)