Fast Connected Components Computation in Large Graphs by Vertex Pruning.

Bibliographic Details
Title:	Fast Connected Components Computation in Large Graphs by Vertex Pruning.
Authors:	Lulli, Alessandro¹, Carlini, Emanuele², Dazzi, Patrizio², Lucchese, Claudio², Ricci, Laura¹
Source:	IEEE Transactions on Parallel & Distributed Systems. Mar2017, Vol. 28 Issue 3, p760-773. 14p.
Subject Terms:	*Computer architecture, Social network analysis, WebGL (Computer program language), Image processing, Computers in graph theory
Abstract:	Finding connected components is a fundamental task in applications dealing with graph analytics, such as social network analysis, web graph mining and image processing. The exponentially growing size of today's graphs has required the definition of new computational models and algorithms for their efficient processing on highly distributed architectures. In this paper we present cracker, an efficient iterative MapReduce-like algorithm to detect connected components in large graphs. The strategy of cracker is to transform the input graph in a set of trees, one for each connected component in the graph. Nodes are iteratively removed from the graph and added to the trees, reducing the amount of computation at each iteration. We prove the correctness of the algorithm, evaluate its computational cost and provide an extensive experimental evaluation considering a wide variety of synthetic and real-world graphs. The experimental results show that cracker consistently outperforms state-of-the-art approaches both in terms of total computation time and volume of messages exchanged. [ABSTRACT FROM PUBLISHER]
	Copyright of IEEE Transactions on Parallel & Distributed Systems is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Business Source Index

Be the first to leave a comment!