Efficient parallel algorithms for some graph problems
We study parallel algorithms for a number of graph problems, using the Single Instruction Stream-Multiple Data Stream model. We assume that the processors have access to…
Efficient parallel algorithms for some graph problems
An O(n) algorithm for determining a near-optimal computation order of matrix chain products
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved