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)
Node-to-set and set-to-set cluster fault tolerant routing in hypercubes
Parallel Computing
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
Journal of Parallel and Distributed Computing
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
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
Graph Theory With Applications
Graph Theory With Applications
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
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
Many-to-many disjoint paths in faulty hypercubes
Information Sciences: an International Journal
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
The spanning connectivity of folded hypercubes
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Three disjoint path paradigms in star networks
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
IEEE Transactions on Parallel and Distributed Systems
Strong Diagnosability and Conditional Diagnosability of Multiprocessor Systems and Folded Hypercubes
IEEE Transactions on Computers
| Hi-index | 0.00 |
A folded hypercube is basically a hypercube with additional links augmented, where the additional links connect all pairs of nodes with longest distance in the hypercube. In an n-dimensional folded hypercube, it has been shown that n+1 node-disjoint paths from one source node to other n+1 (mutually) distinct destination nodes, respectively, can be constructed in O(n^4) time so that their maximal length is not greater than @?n/2@?+1, where n+1 is the connectivity and @?n/2@? is the diameter. Besides, their maximal length is minimized in the worst case. In this paper, we further show that by minimizing the computations of minimal routing functions, these node-disjoint paths can be constructed in O(n^3) time, which is more efficient, and is hard to be reduced because it must take O(n^3) time to compute a minimal routing function by solving a corresponding maximum weighted bipartite matching problem with the best known algorithm.