A Parallel Graph Algorithm for Finding Connected Components

Simple item page
dc.citation.bibtexNametechreporten_US
dc.citation.issueNumberTR7518en_US
dc.citation.journalTitleRice University ECE Technical Reporten_US
dc.contributor.authorHirschberg, D.S.en_US
dc.date.accessioned2007-10-31T00:46:58Z
dc.date.available2007-10-31T00:46:58Z
dc.date.issued1975-10-20
dc.date.modified2003-10-22en_US
dc.date.submitted2003-10-17en_US
dc.descriptionTech Reporten_US
dc.description.abstractA 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.citationD. Hirschberg, "A Parallel Graph Algorithm for Finding Connected Components," <i>Rice University ECE Technical Report,</i> no. TR7518, 1975.
dc.identifier.urihttps://hdl.handle.net/1911/19953
dc.language.isoeng
dc.subjectgraph theory*
dc.subjectparallel processing*
dc.subjectalgorithms*
dc.subjectconnected components*
dc.subject.keywordgraph theoryen_US
dc.subject.keywordparallel processingen_US
dc.subject.keywordalgorithmsen_US
dc.subject.keywordconnected componentsen_US
dc.titleA Parallel Graph Algorithm for Finding Connected Componentsen_US
dc.typeReport
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Hir1975Oct9AParallel.PDF
Size:
219.96 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications