Author： Bruera Francesco
Publisher： Springer Publishing Company
ISSN： 1661-8270
Source： Mathematics in Computer Science, Vol.1, Iss.4, 2008-06, pp. : 709-736
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 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. :
Access to resources
Recommend
On the Complexity of Time-Dependent Shortest Paths
By Foschini Luca Hershberger John Suri Subhash
Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. :
On Bounded Leg Shortest Paths Problems
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
A Branch-Checking Algorithm for All-Pairs Shortest Paths
By Duin Cees
Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. :