A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
2021 IEEE International Conference on Cluster Computing (CLUSTER)
Various concurrent algorithms have been proposed in the literature in recent years that mostly focus on the disjoint set approach to the Connected Components (CC) algorithm. However, these CC algorithms do not take the skewed structure of real-world graphs into account and as a result they do not benefit from common features of graph datasets to accelerate processing. We investigate the implications of the skewed degree distribution of real-world graphs on their connectivity and we use thesedoi:10.1109/cluster48925.2021.00042 fatcat:tuaugzgh5fgh5bm2iwg5hzuyz4