1. A. Donev, Connected components of a graph.
http://computation.pa.msu.edu/NO/ConnCompPresentation.html
. Accessed 16 Feb 2018
2. J.A. Edwards, U. Vishkin, Better speedups using simpler parallel programming for graph connectivity and biconnectivity, in Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores (ACM, New York, 2012), pp. 103–114
3. L.K. Fleischer, B. Hendrickson, A. Pınar, On identifying strongly connected components in parallel, in International Parallel and Distributed Processing Symposium (Springer, Berlin, 2000), pp. 505–511
4. D.S. Hirschberg, A.K. Chandra, D.V. Sarwate, Computing connected components on parallel computers. Commun. ACM 22(8), 461–464 (1979)
5. S. Hong, N.C. Rodia, K.Olukotun, On fast parallel detection of strongly connected components (SCC) in small-world graphs, in Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (ACM, New York, 2013), p. 92