2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DC2019★ 2 cited
Partitioning Graphs for the Cloud using Reinforcement Learning
Mohammad Hasanzadeh Mofrad, Rami Melhem, Mohammad Hammoud
In this paper, we propose Revolver, a parallel graph partitioning algorithm capable of partitioning large-scale graphs on a single shared-memory machine. Revolver employs an asynch…
cs.DB2018
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
Kijung Shin, Euiwoong Lee, Jinoh Oh +2
Given a graph stream, how can we estimate the number of triangles in it using multiple machines with limited storage? Specifically, how should edges be processed and sampled across…