By Topic

Constructing one-to-many disjoint paths in folded hypercubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cheng-Nan Lai ; Data Commun. Group, Chunghwa Telecom Co. Ltd., Taiwan ; Gen-Huey Chen ; Dyi-Rong Duh

Routing functions have been shown effective in deriving disjoint paths in the hypercube. In this paper, using a minimal routing function, k+1 disjoint paths from one node to another k+1 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 k+1 paths plus two). As a by-product, the Rabin number of the folded hypercube is obtained, which is an open problem raised by S.C. Liaw and G.J. Chang (1999)

Published in:

Computers, IEEE Transactions on  (Volume:51 ,  Issue: 1 )