A Branch-Checking Algorithm for All-Pairs Shortest Paths

By Duin Cees  

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 131-145

Springer Publishing Company

Access to resources Recommend Favorite

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

By Zwick Uri  

Algorithmica, Vol. 46, Iss. 2, 2006-10 ,pp. : 181-192

Springer Publishing Company

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

A fully dynamic algorithm for distributed shortest paths

By Cicerone S.   Di Stefano G.   Frigioni D.   Nanni U.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 83-102

Elsevier

Access to resources Recommend Favorite

Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

By Gu Q.P.   Tamaki H.  

Journal of Parallel and Distributed Computing, Vol. 44, Iss. 2, 1997-08 ,pp. : 147-152

Academic Press

Access to resources Recommend Favorite