File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Finding connected components in O(log n loglog n) time on the EREW PRAM
Title | Finding connected components in O(log n loglog n) time on the EREW PRAM |
---|---|
Authors | |
Issue Date | 1993 |
Publisher | Society for Industrial and Applied Mathematics. |
Citation | Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, p. 11-20 How to Cite? |
Abstract | In this paper we present a new parallel algorithm for finding the connected components of an undirected graph. On a graph with n vertices and m edges, the algorithm runs in O(log n loglog n) time using n+m processors on an EREW (exclusive-read and exclusive-write) PRAM. Prior to our work, the best known exclusive-write algorithm for this problem requires O(log1.5 n) time using n+m processors [JM91, KNP92]. |
Persistent Identifier | http://hdl.handle.net/10722/151794 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chong, Ka Wong | en_US |
dc.contributor.author | Lam, Tak Wah | en_US |
dc.date.accessioned | 2012-06-26T06:29:34Z | - |
dc.date.available | 2012-06-26T06:29:34Z | - |
dc.date.issued | 1993 | en_US |
dc.identifier.citation | Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, p. 11-20 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/151794 | - |
dc.description.abstract | In this paper we present a new parallel algorithm for finding the connected components of an undirected graph. On a graph with n vertices and m edges, the algorithm runs in O(log n loglog n) time using n+m processors on an EREW (exclusive-read and exclusive-write) PRAM. Prior to our work, the best known exclusive-write algorithm for this problem requires O(log1.5 n) time using n+m processors [JM91, KNP92]. | en_US |
dc.language | eng | en_US |
dc.publisher | Society for Industrial and Applied Mathematics. | - |
dc.relation.ispartof | Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | en_US |
dc.title | Finding connected components in O(log n loglog n) time on the EREW PRAM | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Lam, Tak Wah:twlam@cs.hku.hk | en_US |
dc.identifier.authority | Lam, Tak Wah=rp00135 | en_US |
dc.identifier.scopus | eid_2-s2.0-0027146874 | en_US |
dc.identifier.spage | 11 | en_US |
dc.identifier.epage | 20 | en_US |
dc.identifier.scopusauthorid | Chong, Ka Wong=7102553941 | en_US |
dc.identifier.scopusauthorid | Lam, Tak Wah=7202523165 | en_US |