FENNEL: streaming graph partitioning for massive scale graphs

Abstract

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and efficient computations on massive graph data such as web graphs, knowledge graphs, and graphs arising in the context of online social networks. Two families of heuristics for graph partitioning in the streaming setting are in wide use: place the newly arrived vertex… (More)
DOI: 10.1145/2556195.2556213

11 Figures and Tables

Topics

Statistics

02040201320142015201620172018
Citations per Year

181 Citations

Semantic Scholar estimates that this publication has 181 citations based on the available data.

See our FAQ for additional information.

  • Blog articles referencing this paper

  • Presentations referencing similar topics