Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

Shay Halperin, Uri Zwick

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Abstract

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 si-numbering we get optimal randomized CREW PRAM algorithms.

Original languageEnglish
Title of host publicationProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
PublisherAssociation for Computing Machinery
Pages438-447
Number of pages10
ISBN (Electronic)0898713668
StatePublished - 28 Jan 1996
Event7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996 - Atlanta, United States
Duration: 28 Jan 199630 Jan 1996

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
VolumePart F129447

Conference

Conference7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996
Country/TerritoryUnited States
CityAtlanta
Period28/01/9630/01/96

Fingerprint

Dive into the research topics of 'Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems'. Together they form a unique fingerprint.

Cite this