Optimal parallel algorithms for graph connectivity. Technical report

Technical Report · Sun Jan 01 00:00:00 EST 1984

OSTI ID:5593589

Reif, J H

A new randomized parallel RAM algorithm is given for finding a spanning forest of an undirected graph in logarithmic time. These time bounds hold with arbitrary high probability for any input graph (i.e., assume random input is not assumed; these bounds hold for the worst case input graph). This result assumes a parallel RAM model which allows both concurrent writes and concurrent reads. Furthermore, it is shown that if the graph is not very sparse (i.e., if the number of edges is at least a logarithmic squared factor more than the number of vertices) then a linear processor time product (even for logarithmic time bounds) can be achieved for finding a spanning tree--which is optimal for the parallel RAM model. Furthermore, a linear-processor, time product can be achieved for even sparser graphs with only slight time increase.

• Research Organization: Harvard Univ., Cambridge, MA (USA). Aiken Computation Lab.
• OSTI ID: 5593589
• Report Number(s): AD-A-152095/6/XAB; TR-08-84
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER GRAPHICS
OPTIMIZATION
PARALLEL PROCESSING
ALGORITHMS
PROBABILITY
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers