High-probability parallel transitive-closure algorithms
Journal Article
·
· SIAM Journal on Computing (Society for Industrial and Applied Mathematics); (United States)
- Department of Computer Science, Stanford University, Stanford, CA (US)
- AT and T Bell Lab., Murrray Hill, NJ (US)
This paper reports on cen algorithm for computing the transitive-closure of an n-node graph in O(log{sup 2} n) time on an EREW-PRAM, using n{sup 3}/log n processors, or with M(n)log n processors if serial matrix multiplication in M(n) time can be done. This algorithm is within a log factor of optimal in work (processor-time product), for solving the all-pairs transitive-closure problem for dense graphs. Finally, it is shown haw to do breadth-first-search with the same performance as can be achieved for single-source transitive closure.
- OSTI ID:
- 5926155
- Journal Information:
- SIAM Journal on Computing (Society for Industrial and Applied Mathematics); (United States), Journal Name: SIAM Journal on Computing (Society for Industrial and Applied Mathematics); (United States) Vol. 20:1; ISSN SMJCA; ISSN 0097-5397
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
Parallel algorithm for finding a blocking flow in an acyclic network
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Journal Article
·
Sat Aug 01 00:00:00 EDT 1992
· International Journal of Parallel Programming; (United States)
·
OSTI ID:7067425
Parallel algorithm for finding a blocking flow in an acyclic network
Technical Report
·
Sat Oct 01 00:00:00 EDT 1988
·
OSTI ID:7083935
Theoretical and experimental analyses of parallel combinatorial algorithms. Doctoral thesis
Technical Report
·
Sun Oct 01 00:00:00 EDT 1989
·
OSTI ID:6963697