Optimisation techniques for finding connected components in large graphs using GraphX
(2018)
Thesis
Turifi, M. (in press). Optimisation techniques for finding connected components in large graphs using GraphX. (Thesis). The University of Salford
The problem of finding connected components in undirected graphs has been well studied. It is an essential pre-processing step to many graph computations, and a fundamental task in graph analytics applications, such as social network analysis, web gr... Read More about Optimisation techniques for finding connected components in large graphs using GraphX.