Efficient parallel algorithms for a class of graph theoretic problems
SIAM Journal on Computing
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A linear time algorithm for the lowest common ancestors problem
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
IEEE Transactions on Computers
| Hi-index | 14.98 |
Two parallel algorithms for finding the lowest common ancestors of a set of vertex pairs Q (the query set) in a directed tree are presented. With all the overheads taken into account, these algorithms take O((n + QI) P log2 n) and O(n2/p + log2n) time, respectively, with p( 0) processors (n is the size of the tree). These results are better than the best known result in that the first achieves th