Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Topological Properties of Hypercubes
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Combinatorial properties of generalized hypercube graphs
Information Processing Letters
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
IEEE Transactions on Computers
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
Parallel Computing
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
From Hall's matching theorem to optimal routing on hypercubes
Journal of Combinatorial Theory Series B
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
Journal of Parallel and Distributed Computing
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
Graph Theory With Applications
Graph Theory With Applications
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
On Disjoint Shortest Paths Routing on the Hypercube
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Three disjoint path paradigms in star networks
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 5.23 |
Efficient methods have been developed for constructing m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube so that not only is their total length minimized, but their maximal length is also minimized in the worst case, where m@?n. For general case, their maximal length is not greater than the minimum of n+1 and the maximal distance (between the source node and destination nodes) plus two. In this paper, we show that their maximal length can be further reduced by at least 1 if one of the two conditions holds. Besides, their total length remains minimum, and each path remains either shortest or second shortest. In the situation that all of the source node and destination nodes are mutually distinct, computer simulation results show that by excluding two trivial worst cases in which the maximal length of (previously) constructed node-disjoint paths (from the source node to the destination nodes) 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.