7 citations · 10 across the 3 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2021
Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling
Masatoshi Hanai, Nikos Tziritas, Toyotaro Suzumura +2
The dynamic scaling of distributed computations plays an important role in the utilization of elastic computational resources, such as the cloud. It enables the provisioning and de…
cs.DC2019
Distributed Edge Partitioning for Trillion-edge Graphs
Masatoshi Hanai, Toyotaro Suzumura, Wen Jun Tan +3
We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed graph partitioning method that can scale to trillion-edge graphs while providing high partiti…