Author： Cicerone S. Di Stefano G. Frigioni D. Nanni U.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.297, Iss.1, 2003-03, pp. : 83-102
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
Access to resources
Recommend
A Branch-Checking Algorithm for All-Pairs Shortest Paths
By Duin Cees
Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. :
Dynamic Multi-level Overlay Graphs for Shortest Paths
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :
Context-free recognition via shortest paths computation: a version of Valiant's algorithm
By Rytter W.
Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. :
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
By Ibarra Louis
Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. :