Author： Thorup M.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.35, Iss.2, 2000-05, pp. : 189-201
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
A Randomized Parallel Algorithm for Single-Source Shortest Paths
Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. :
Access to resources
Recommend
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time
Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. :
Algorithms for shortest paths and d-cycle problems
By Bespamyatnikh S. Kelarev A.
Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. :
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
By Cohen E.
Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. :