Author： Klein P.N. Subramanian S.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.25, Iss.2, 1997-11, pp. : 205-220
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time
Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. :
Access to resources
Recommend
Floats, Integers, and Single Source Shortest Paths
By Thorup M.
Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. :
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
By Cohen E.
Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. :
An `All Pairs Shortest Paths' Distributed Algorithm Using 2 n 2 Messages
By Haldar S.
Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. :