Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S.   Ghosh R.K.   Reddy A.P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

Communication in the two-way listen-in vertex-disjoint paths mode

By Bockenhauer H.-J.  

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 65-90

Elsevier

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V.   Khanna S.   Rajaraman R.   Shepherd B.   Yannakakis M.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

Access to resources Recommend Favorite

Adaptive Wormhole Routing in Hypercube Multicomputers

By Lin X.   Esfahanian A.H.   Burago A.  

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 2, 1998-02 ,pp. : 165-174

Academic Press

Access to resources Recommend Favorite

On Finding Min-Min Disjoint Paths

By Guo Longkun  

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 641-653

Springer Publishing Company

Access to resources Recommend Favorite