Shortcutting Label Propagation for Distributed Connected Components.

Stergios Stergiou,Dipen Rughwani,Kostas Tsioutsiouliklis

WSDM 2018: The Eleventh ACM International Conference on Web Search and Data Mining Marina Del Rey CA USA February, 2018（2018）

引用 38|浏览44

暂无评分

摘要

Connected Components is a fundamental graph mining problem that has been studied for the PRAM, MapReduce and BSP models. We present a simple CC algorithm for BSP that does not mutate the graph, converges in O(log n) supersteps and scales to graphs of trillions of edges.

查看译文

关键词

connected components, label propagation, LPSC, graph algorithms, distributed systems

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要