Streaming Graph Partitioning in the Planted Partition Model

  title={Streaming Graph Partitioning in the Planted Partition Model},
  author={Charalampos E. Tsourakakis},
The sheer increase in the size of graph data has created a lot of interest into developing efficient distributed graph processing frameworks. Popular existing frameworks such as GraphLab and Pregel rely on balanced graph partitioning in order to minimize communication and achieve work balance. In this work we contribute to the recent research line of streaming graph partitioning [30], ;31], [34] which computes an approximately balanced k-partitioning of the vertex set of a graph using a single… CONTINUE READING