Constructing One-to-Many Disjoint Paths in Folded Hypercubes

Authors:
Cheng-Nan Lai;Gen-Huey Chen;Dyi-Rong Duh
Affiliations:
Data Communication Group, Taiwan;National Taiwan Univ., Taipei, Taiwan;National Chi Nan Univ., Nantou, Taiwan
Venue:
IEEE Transactions on Computers
Year:
2002

Citing 11
Cited 11

Topological Properties of Hypercubes

IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Topological properties of WK-recursive networks

Journal of Parallel and Distributed Computing
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes

IEEE Transactions on Computers
Optimal Parallel Routing in Star Networks

IEEE Transactions on Computers
Fault Tolerance Properties of Pyramid Networks

IEEE Transactions on Computers
From Hall's matching theorem to optimal routing on hypercubes

Journal of Combinatorial Theory Series B
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Extremal Graph Theory

Extremal Graph Theory
Graph Theory With Applications

Graph Theory With Applications

Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Strong Rabin numbers of folded hypercubes

Theoretical Computer Science
On reliability of the folded hypercubes

Information Sciences: an International Journal
On conditional diagnosability of the folded hypercubes

Information Sciences: an International Journal
Fault-free cycles in folded hypercubes with more faulty elements

Information Processing Letters
Some results on topological properties of folded hypercubes

Information Processing Letters
One-to-many node-disjoint paths in (n,k)-star graphs

Discrete Applied Mathematics
The spanning connectivity of folded hypercubes

Information Sciences: an International Journal
ω-wide diameters of enhanced pyramid networks

Theoretical Computer Science
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Discrete Applied Mathematics
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

Routing functions have been shown effective in deriving disjoint paths in the hypercube. In this paper, using a minimal routing function, disjoint paths from one node to another distinct nodes are constructed in a k-dimensional folded hypercube whose maximal length is not greater than the diameter plus one, which is minimum in the worst case. For the general case, the maximal length is nearly optimal (the maximal distance between the two end nodes of these paths plus two). As a by-product, the Rabin number of the folded hypercube is obtained, which is an open problem raised by Liaw and Chang.