An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results

IEEE Transactions on Computers

Multiple Paths Extraction in Images Using a Constrained Expanded Trellis

IEEE Transactions on Pattern Analysis and Machine Intelligence

Node-disjoint paths in hierarchical hypercube networks

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

Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Journal of Computer and System Sciences

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

Theoretical Computer Science

Topological properties of folded hyper-star networks

The Journal of Supercomputing

One-to-many node-disjoint paths of hyper-star networks

Discrete Applied Mathematics

Node-disjoint paths in a level block of generalized hierarchical completely connected networks

Theoretical Computer Science

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

Journal of Parallel and Distributed Computing