Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
An efficient algorithm for k-pairwise disjoint paths in star graphs
Information Processing Letters
A Routing and Broadcasting Scheme on Faulty Star Graphs
IEEE Transactions on Computers
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Motivated by parallel routing in networks with faults, we study the following graph theoretical problem. Let G be a d-regular graph. We say that G is strongly Menger-connected if for any copy Gf of G with at most d - 2 nodes removed, every pair of nodes u and v in Gf are connected by min{deg f(u), deg f(v)} node-disjoint paths in Gf, where deg f(u) and deg f(v) are the degrees of the nodes u and v in Gf, respectively. We show that the star graphs, which are a recently proposed attractive alternative to the widely used hypercubes as network models, are strongly Menger-connected. An algorithm of optimal running time is developed that constructs the maximum number of node-disjoint paths of nearly optimal length in star graphs with faults.