@inproceedings{ee35813ca95f4f5990dc4880a0d350de,
title = "Fast connected components algorithms for the EREW PRAM",
abstract = "We present fast and efficient parallel algorithms for finding the connected components of an undirected graph. These algorithms run on the exclusive-read, exclusive-write (EREW) PRAM. On a graph with n yertices and m edges, our randomized algorithm runs in O(log n) time using (m + n1+ε)/log n EREW processors (for any fixed ε > 0). A variant uses (m + n)/log n processors and runs in O(log n log log n) time. A deterministic version of the algorithm runs in O(log1.5 n) time using m + n EREW processors.",
author = "Karger, {David R.} and Noam Nisan and Michal Parnas",
year = "1992",
doi = "10.1145/140901.141920",
language = "אנגלית",
isbn = "089791483X",
series = "4th Annual ACM Symposium on Parallel Algorithms and Architectures",
publisher = "Publ by ACM",
pages = "373--381",
booktitle = "4th Annual ACM Symposium on Parallel Algorithms and Architectures",
note = "4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92 ; Conference date: 29-06-1992 Through 01-07-1992",
}