Description
See http://www.charlesneedham.com/pubs/166151/kdd325-stanton.pdf
Conclusion:
We have demonstrated that simple, one-pass streaming graph partitioning heuristics can dramatically improve the edge-cut in distributed graphs. Our best performing heuris- tic is the linear weighted variant of the greedy algorithm. This is a simple and effective preprocessing step for large graph computation systems, as the data must be loaded onto the cluster any way.
...
Attachments
Issue Links
- is part of
-
HAMA-892 Add Vertex Partitioner Interface for custom graph partitioner
-
- Open
-