![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Roditty Liam Segal Michael
Publisher: Springer Publishing Company
ISSN: 0178-4617
Source: Algorithmica, Vol.59, Iss.4, 2011-04, pp. : 583-600
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On the Complexity of Time-Dependent Shortest Paths
By Foschini Luca Hershberger John Suri Subhash
Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A Branch-Checking Algorithm for All-Pairs Shortest Paths
By Duin Cees
Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :