A Randomized Parallel Algorithm for Single-Source Shortest Paths

By Klein P.N.   Subramanian S.  

Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. : 205-220

Academic Press

Access to resources Recommend Favorite

An efficient label setting/correcting shortest path algorithm

By Sedeño-Noda Antonio  

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 437-455

Springer Publishing Company

Access to resources Recommend Favorite

All Pairs Shortest Distances for Graphs with Small Integer Length Edges

By Galil Z.   Margalit O.  

Information and Computation, Vol. 134, Iss. 2, 1997-05 ,pp. : 103-139

Academic Press

Access to resources Recommend Favorite

Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time

By Kolliopoulos S.G.   Stein C.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 125-141

Academic Press

Access to resources Recommend Favorite

An efficient distributed algorithm for finding all hinge vertices in networks

By Ho Ting-yem  

International Journal of Computer Mathematics, Vol. 82, Iss. 7, 2005-07 ,pp. : 821-825

Taylor & Francis Ltd

Access to resources Recommend Favorite