no code implementations • 24 Sep 2013 • Vincent Blondel, Kyomin Jung, Pushmeet Kohli, Devavrat Shah
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster.