Author： Yu Li Moretti Christopher Thrasher Andrew Emrich Scott Judd Kenneth Thain Douglas
Publisher： Springer Publishing Company
ISSN： 1386-7857
Source： Cluster Computing, Vol.13, Iss.3, 2010-09, pp. : 243-256
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
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
By Shapira Asaf Yuster Raphael Zwick Uri
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,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. :
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
By Milovanović E. Milovanović I. Bekakos M. Tselepis I.
The Journal of Supercomputing, Vol. 40, Iss. 1, 2007-04 ,pp. :
Towards an operating system managing parallelism of computing on clusters
Future Generation Computer Systems, Vol. 17, Iss. 3, 2000-11 ,pp. :