Node-to-set and set-to-set cluster fault tolerant routing in hypercubes

n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

Parallel Computing

Complexity of pairwise shortest path routing in the grid

Theoretical Computer Science

On Disjoint Shortest Paths Routing on the Hypercube

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications

Set-to-set disjoint-paths routing in recursive dual-net

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I

Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Theoretical Computer Science

Fault-Tolerant node-to-set disjoint-path routing in hypercubes

ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I

Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes

Journal of Parallel and Distributed Computing