A Parallel Graph Algorithm for Finding Connected Components
dc.citation.bibtexName | techreport | en_US |
dc.citation.issueNumber | TR7518 | en_US |
dc.citation.journalTitle | Rice University ECE Technical Report | en_US |
dc.contributor.author | Hirschberg, D.S. | en_US |
dc.date.accessioned | 2007-10-31T00:46:58Z | |
dc.date.available | 2007-10-31T00:46:58Z | |
dc.date.issued | 1975-10-20 | |
dc.date.modified | 2003-10-22 | en_US |
dc.date.submitted | 2003-10-17 | en_US |
dc.description | Tech Report | en_US |
dc.description.abstract | A parallel program is presented that determines the connected components of an undirected graph in time 0(log<sup>2</sup>n) using n<sup>2</sup> processors. It is assumed that the processors have access to common memory. Simultaneous access to the same location is permitted for fetch, but not store, instructions. | en_US |
dc.identifier.citation | D. Hirschberg, "A Parallel Graph Algorithm for Finding Connected Components," <i>Rice University ECE Technical Report,</i> no. TR7518, 1975. | |
dc.identifier.uri | https://hdl.handle.net/1911/19953 | |
dc.language.iso | eng | |
dc.subject | graph theory | * |
dc.subject | parallel processing | * |
dc.subject | algorithms | * |
dc.subject | connected components | * |
dc.subject.keyword | graph theory | en_US |
dc.subject.keyword | parallel processing | en_US |
dc.subject.keyword | algorithms | en_US |
dc.subject.keyword | connected components | en_US |
dc.title | A Parallel Graph Algorithm for Finding Connected Components | en_US |
dc.type | Report | |
dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1