File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICAPP.1995.472217
- Scopus: eid_2-s2.0-0029218393
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Improved parallel algorithms for finding connected components
Title | Improved parallel algorithms for finding connected components |
---|---|
Authors | |
Issue Date | 1995 |
Publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000029 |
Citation | Ieee International Conference On Algorithms And Architectures For Parallel Processing, 1995, v. 1, p. 452-459 How to Cite? |
Abstract | Finding the connected components of a graph is a basic computational problem. In recent years, there were several exciting results in breaking the log2 n-time barrier to finding connected components on parallel machines using shared memory without concurrent-write capability. This paper further presents two new parallel algorithms both using less than log2 n time. The merit of the first algorithm is that it uses only a sublinear number of processors, yet retains the time complexity of the fastest existing algorithm. The second algorithm is slightly slower but its work (i.e., the time-processor product) is closer to optimal than all previous algorithms using less than log2 n time. |
Persistent Identifier | http://hdl.handle.net/10722/45553 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chong, KW | en_HK |
dc.contributor.author | Lam, TW | en_HK |
dc.date.accessioned | 2007-10-30T06:29:02Z | - |
dc.date.available | 2007-10-30T06:29:02Z | - |
dc.date.issued | 1995 | en_HK |
dc.identifier.citation | Ieee International Conference On Algorithms And Architectures For Parallel Processing, 1995, v. 1, p. 452-459 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45553 | - |
dc.description.abstract | Finding the connected components of a graph is a basic computational problem. In recent years, there were several exciting results in breaking the log2 n-time barrier to finding connected components on parallel machines using shared memory without concurrent-write capability. This paper further presents two new parallel algorithms both using less than log2 n time. The merit of the first algorithm is that it uses only a sublinear number of processors, yet retains the time complexity of the fastest existing algorithm. The second algorithm is slightly slower but its work (i.e., the time-processor product) is closer to optimal than all previous algorithms using less than log2 n time. | en_HK |
dc.format.extent | 542046 bytes | - |
dc.format.extent | 4181 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000029 | en_HK |
dc.relation.ispartof | IEEE International Conference on Algorithms and Architectures for Parallel Processing | en_HK |
dc.rights | ©1995 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.title | Improved parallel algorithms for finding connected components | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Lam, TW:twlam@cs.hku.hk | en_HK |
dc.identifier.authority | Lam, TW=rp00135 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICAPP.1995.472217 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0029218393 | en_HK |
dc.identifier.hkuros | 1265 | - |
dc.identifier.volume | 1 | en_HK |
dc.identifier.spage | 452 | en_HK |
dc.identifier.epage | 459 | en_HK |
dc.identifier.scopusauthorid | Chong, KW=7102553941 | en_HK |
dc.identifier.scopusauthorid | Lam, TW=7202523165 | en_HK |