
- 1 Chandy, K. and Misra, J., Parallel Program Design. Addison-Wesley, 1988. Google Scholar
Digital Library
- 2 Quinn, M., Designing E~cient Algorztms for Parallel Computers, McGraw-Hill, 1987. Google Scholar
Digital Library
Index Terms
Searching in parallel: a case study with the single-source shortest path algorithm
Recommendations
Solving all-pairs shortest path by single-source computations
Given an arbitrary directed graph G=(V,E) with non-negative edge lengths, we present an algorithm that computes all pairs shortest paths in time O(mn+mlgn+nT(m,n)), where m is the number of different edges contained in shortest paths and T(m,n) is the ...
A Multiple Pairs Shortest Path Algorithm
The multiple pairs shortest path problem (MPSP) arises in many applications where the shortest paths and distances between only some specific pairs of origin-destination (OD) nodes in a network are desired. The traditional repeated single-source ...
Finding min-sum disjoint shortest paths from a single source to all pairs of destinations
TAMC'06: Proceedings of the Third international conference on Theory and Applications of Models of ComputationGiven a graph G = (V, E) with |V| = n, |E| = m, and a source node s, we consider the problem of finding two disjoint paths from s to two destination nodes t1 and t2 with minimum total length, for every pair nodes t1, t2 ∈ V–{s}. One efficient solution ...






Comments