Finding connected components in map-reduce in logarithmic rounds
ICDE, pp. 50-61, 2013.
randomized algorithmefficient map-reduce algorithmstandard map-reduce featurelogarithmic roundmap-reduce algorithmMore(6+)
Given a large graph G = (V, E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fundamental trade-off exists between the number of map-reduce rounds and the communication of each round. Denoting d the diameter of the graph, and n the number ...More
Full Text (Upload PDF)
PPT (Upload PPT)