Hirschberg, D.S.2007-10-312007-10-311975-10-202003-10-17D. Hirschberg, "A Parallel Graph Algorithm for Finding Connected Components," <i>Rice University ECE Technical Report,</i> no. TR7518, 1975.https://hdl.handle.net/1911/19953Tech ReportA parallel program is presented that determines the connected components of an undirected graph in time 0(log²n) using n² 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.enggraph theoryparallel processingalgorithmsconnected componentsReportgraph theoryparallel processingalgorithmsconnected components