A unified approach to domination problems on interval graphs
Information Processing Letters
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Efficient parallel algorithms for shortest paths in planar graphs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
A unified approach to parallel depth-first traversals of general trees
Information Processing Letters
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Breadth-first traversal of trees and integer sorting in parallel
Information Processing Letters
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
All pairs shortest distances for graphs with small integer length edges
Information and Computation
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A cost optimal parallel algorithm is presented to find the all-pairs shortest paths on an unweighted interval graph which takes O(n/p + log n) time on an EREW PRAM, where np and n represent respectively the number of processors and the number of vertices of the graph.