![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Guerriero F. Musmanno R.
Publisher: Springer Publishing Company
ISSN: 0022-3239
Source: Journal of Optimization Theory and Applications, Vol.104, Iss.1, 2000-01, pp. : 91-108
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Algorithms for shortest paths and d-cycle problems
By Bespamyatnikh S. Kelarev A.
Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
By Cohen E.
Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A Randomized Parallel Algorithm for Single-Source Shortest Paths
Journal of Algorithms, Vol. 25, Iss. 2, 1997-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)