A transfer network for the Arbitrary Rotation of Digitised Images
The Computer Journal
Topological Properties of Hypercubes
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topological properties of WK-recursive networks
Journal of Parallel and Distributed Computing
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
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
Node-disjoint paths in hierarchical hypercube networks
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Embedding hypercubes, rings, and odd graphs into hyper-stars
International Journal of Computer Mathematics
On the surface area of the (n,k)-star graph
Theoretical Computer Science
Longest fault-free paths in hypercubes with vertex faults
Information Sciences: an International Journal
Distance formula and shortest paths for the (n,k)-star graphs
Information Sciences: an International Journal
Improving bounds on link failure tolerance of the star graph
Information Sciences: an International Journal
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
Information Sciences: an International Journal
Hi-index | 0.00 |
In practice it is important to construct node-disjoint paths in networks, because they can be used to increase the transmission rate and enhance the transmission reliability. The folded hyper-star networks FHS(2n,n) were introduced to be a competitive model to both hypercubes and star graphs. They are bipartite and node-symmetric, though not edge-symmetric, and have diameter n. In this paper we construct a maximum number of node-disjoint paths between every two distinct nodes of FHS(2n,n) and show that its fault diameter is n+2 for n驴4. We also suggest a one-to-all broadcasting algorithm of FHS(2n,n) under the all-port model.