Author： Shapira Asaf Yuster Raphael Zwick Uri
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.59, Iss.4, 2011-04, pp. : 621-633
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
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Access to resources
Recommend
A Branch-Checking Algorithm for All-Pairs Shortest Paths
By Duin Cees
Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. :
By Milovanović E. Milovanović I. Bekakos M. Tselepis I.
The Journal of Supercomputing, Vol. 40, Iss. 1, 2007-04 ,pp. :
Longest fault-free paths in star graphs with vertex faults
By Hsieh S.-G. Chen G.-H. Ho C.-W.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
By Yu Li Moretti Christopher Thrasher Andrew Emrich Scott Judd Kenneth Thain Douglas
Cluster Computing, Vol. 13, Iss. 3, 2010-09 ,pp. :