An efficient algorithm for k-pairwise disjoint paths in star graphs

On Strong Menger-Connectivity of Star Graphs

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science

On strong Menger-connectivity of star graphs

Discrete Applied Mathematics

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

k-pairwise disjoint paths routing in perfect hierarchical hypercubes

The Journal of Supercomputing