Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems
Conference
·
OSTI ID:416828
- Tel Aviv Univ. (Israel)
We present the first randomized O(log n) time and O(m + n) work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = (V, E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as finding a bipartite partition, finding bridges and biconnected components, and finding Euler tours in Eulerean graphs. For other problems such as finding an ear decomposition, finding an open ear decomposition, finding a strong orientation, and finding an st-numbering we get optimal randomized CREW PRAM algorithms.
- OSTI ID:
- 416828
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time
A lower bound for the QRQW PRAM
Lower bounds for randomized Exclusive Write PRAMs
Journal Article
·
Sun Jan 31 23:00:00 EST 1988
· SIAM J. Comput.; (United States)
·
OSTI ID:7020008
A lower bound for the QRQW PRAM
Conference
·
Tue May 02 00:00:00 EDT 1995
·
OSTI ID:93994
Lower bounds for randomized Exclusive Write PRAMs
Conference
·
Tue May 02 00:00:00 EDT 1995
·
OSTI ID:80391