LAUSR

Edge Repartitioning via Structure-Aware Group Migration

Sign Up to like & get
recommendations!
1 Published in 2022 at "IEEE Transactions on Computational Social Systems"

DOI: 10.1109/tcss.2021.3090373

Abstract: Graph partitioning is a mandatory step in distributed graph computing systems. Some existing systems use edge partitioning methods to partition static graphs. However, the structure of the real-world graphs changes dynamically, which leads to unnecessary… read more here.

Keywords: vertex replicas; structure; structure aware; group ... See more keywords