Author
Cheng-Nan Lai
Bio: Cheng-Nan Lai is an academic researcher from National Kaohsiung Marine University. The author has contributed to research in topics: Hypercube & Vertex (geometry). The author has an hindex of 4, co-authored 4 publications receiving 30 citations.
Papers
More filters
TL;DR: It is shown that the strong Rabin number of a k-dimensional folded hypercube is ⌈k/2⌉ + 1, where ⌉k/1⌊ is the diameter of the k- dimensional folded hyper cube and each node-disjoint path has length not greater than the distance between the two end nodes plus two.
13 citations
TL;DR: Computer simulation results show that by excluding two trivial worst cases in which the maximal length of constructed node-disjoint paths is not only greater than the maximal distance but also impossible to be further reduced, the probability that one of the two conditions holds is greater than 71, 73, 79%, and 85% for m=n=4,5,6, and 7, respectively.
8 citations
TL;DR: This paper gives a sufficient condition for the existence of m vertex-disjoint shortest paths from one source vertex to other m (not necessarily distinct) destination vertices in a Cayley graph of an abelian group, where m ?
5 citations
TL;DR: It is shown that an r-dimensional generalized hypercube, denoted by G(m"r, m"r"r"-1,...,m"1), satisfies the 2RP-property except some special conditions, where m"i>=4 for all 1=
4 citations
Cited by
More filters
TL;DR: The n-dimensional folded hypercube FQ"n, a variation of the hypercube proposed by Ahmed et al, is an (n+1)-regular (n-1)-connected graph and under PMC-model the conditional diagnosability is 4n-3 when n=5 or n>=8.
94 citations
TL;DR: A maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network, which can facilitate the VLSI design and fabrication.
57 citations
TL;DR: This paper studies the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings, which belong to two-matching composition networks.
Abstract: Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In this paper, we study the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings. By applying our result to multiprocessor systems, we also compute the diagnosability of folded hypercubes and augmented cubes, both of which belong to two-matching composition networks.
56 citations
TL;DR: This paper shows that FQ"n-FF-v-FF"e contains a fault-free cycle with length at least 2^n-2|FF"v| if |FF" e|+|FF "v|=<2n-4 and |ff"e|==3.
38 citations
Journal Article•
TL;DR: A particle swarm optimisation (PSO) algorithm in fuzzy environment is used for the shortest path problem on a network where arc weights are represented by different kinds of fuzzy numbers due to its superior convergence speed.
Abstract: Shortest path problem is one of the most fundamental components in the fields of transportation and communication networks. This paper concentrates on a shortest path problem on a network where arc weights are represented by different kinds of fuzzy numbers. Recently, a genetic algorithm has been proposed for finding the shortest path in a network with mixed fuzzy arc weights due to the complexity of the addition of various fuzzy numbers for larger problems. In this paper, a particle swarm optimisation (PSO) algorithm in fuzzy environment is used for the same due to its superior convergence speed. The main contribution of this paper is the reduction of the time complexity of the existing genetic algorithm. Additionally, to compare the obtained results of the proposed PSO algorithm with those of the existing algorithm, two shortest path problems having mixed fuzzy arc weights are solved. The comparative examples illustrate that the algorithm proposed in this paper is more efficient than the existing algorithm in terms of time complexity.
38 citations