Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments
As dynamic graph data have been actively used, incremental graph partition schemes have been studied to efficiently store and manage large graphs. In this paper, we propose a vertex-cut based novel incremental graph partitioning scheme that supports load balancing in a distributed environment. The p...
Main Authors: | Dojin Choi, Jinsu Han, Jongtae Lim, Jinsuk Han, Kyoungsoo Bok, Jaesoo Yoo |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9415741/ |
Similar Items
-
Scalable Streaming Graph Partitioning
by: Seyed Khamoushi, Seyed Mohammadreza
Published: (2017) -
Vertex Separators for Partitioning a Graph
by: Cem Evrendilek
Published: (2008-02-01) -
On vertex stability of complete k-partite graphs
by: Mateusz Nikodem
Published: (2015-01-01) -
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
by: GOSSETT, ERIC JAMES.
Published: (1984) -
Use Multilevel Graph Partitioning Scheme to solve traveling salesman problem
by: KHAN, Muhammad Umair
Published: (2010)