Balanced label propagation for partitioning massive graphs
WSDM, pp. 507-516, 2013.
Partitioning graphs at scale is a key challenge for any application that involves distributing a graph across disks, machines, or data centers. Graph partitioning is a very well studied problem with a rich literature, but existing algorithms typically can not scale to billions of edges, or can not provide guarantees about partition sizes....More
Full Text (Upload PDF)
PPT (Upload PPT)
Best Paper of WSDM, 2013