![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Banerjee S. Ghosh R.K. Reddy A.P.K.
Publisher: Academic Press
ISSN: 0743-7315
Source: Journal of Parallel and Distributed Computing, Vol.33, Iss.2, 1996-03, pp. : 165-171
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)
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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/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. :