Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Cheng-Nan Lai ; Dept. of Inf. Manage., Nat. Kaohsiung Marine Univ., Kaohsiung, Taiwan

Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an n-dimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(mn1.5) time, where m ≤ n. The construction procedure has worst case time complexity O(mn), which is optimal and hence improves previous results. By taking advantages of the construction procedure, m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube such that their total length is minimized can be constructed in O(mn1.5 + m3n) time, which is more efficient than the previous result of O(m2n2.5 + mn3) time. Besides, their maximal length is also minimized in the worst case.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:23 ,  Issue: 6 )