Results 1 to 10 of about 193,029 (263)

Dynamic Balanced Graph Partitioning [PDF]

SIAM Journal on Discrete Mathematics, 2020
This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between $n$ nodes, with patterns that may change over time, the objective is to ...
Avin, Chen, Bienkowski, Marcin, Loukas, Andreas, Pacut, Maciej, Schmid, Stefan   +4 more
core   +3 more sources

DHPV: a distributed algorithm for large-scale graph partitioning [PDF]

Journal of Big Data, 2020
Big graphs are part of the movement of “Not Only SQL” databases (also called NoSQL) focusing on the relationships between data, rather than the values themselves.
Wilfried Yves Hamilton Adoni, Tarik Nahhal, Moez Krichen, Abdeltif El byed, Ismail Assayad   +4 more
doaj   +2 more sources

A social network graph partitioning algorithm based on double deep Q-Network [PDF]

Scientific Reports
With the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However,
Jie Cao, Haoxiang Wang, Jingru Jiao, Kekun Hu, Ping Qi   +4 more
doaj   +2 more sources

Extremal Optimization for Graph Partitioning [PDF]

Physical Review E, 2001
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem.
A. K. Hartmann, A. Möbius, Allon G. Percus, B. A. Hendrickson, B. Bollobas, C. J. Alpert, D. R. Chialvo, D. S. Johnson, D. S. Johnson, E. Tuzel, G. Ausiello, G. S. Grest, G. Toulouse, H. Frauenkron, I. Balberg, J. Holland, J. R. Banavar, K. F. Pal, K. Y. M. Wong, K. Y. M. Wong, M. Mezard, M. Mezard, M. Paczuski, M. Palassini, M. R. Garey, P. Bak, P. Bak, P. Cheeseman, P. Erdös, R. Monasson, R. Monasson, R. Monasson, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. Boettcher, S. J. Gould, S. Kirkpatrick, S. Kirkpatrick, Stefan Boettcher, T. Klotz, Y. T. Fu   +44 more
core   +3 more sources

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology. [PDF]

PLoS ONE, 2014
Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in
Namhee Kim, Zhe Zheng, Shereef Elmetwaly, Tamar Schlick   +3 more
doaj   +2 more sources

Graph Computing Systems and Partitioning Techniques: A Survey

IEEE Access, 2022
Graphs are a tremendously suitable data representations that model the relationships of entities in many application domains, such as recommendation systems, machine learning, computational biology, social network analysis, and other application domains.
Tewodros Alemu Ayall, Huawen Liu, Changjun Zhou, Abegaz Mohammed Seid, Fantahun Bogale Gereme, Hayla Nahom Abishu, Yasin Habtamu Yacob   +6 more
doaj   +1 more source

Dynamic Graph Partitioning Scheme for Supporting Load Balancing in Distributed Graph Environments

IEEE Access, 2021
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
Dojin Choi, Jinsu Han, Jongtae Lim, Jinsuk Han, Kyoungsoo Bok, Jaesoo Yoo   +5 more
doaj   +1 more source

Fuzzy-Based Balanced Partitioning Under Capacity and Size-Tolerance Constraints in Distributed Quantum Circuits

IEEE Transactions on Quantum Engineering, 2023
It is important for the design of a distributed quantum circuit (DQC) to minimize the communication cost in k-way balanced partitioning. In this article, given an original quantum circuit (QC), a partitioning number k, the maximum capacity δ ...
Jin-Tai Yan
doaj   +1 more source

Skeleton-Based ST-GCN for Human Action Recognition With Extended Skeleton Graph and Partitioning Strategy

IEEE Access, 2022
Skeleton-based Graph Convolutional Networks (GCN) for human action and interaction recognition have received considerable attention of researchers due to its compact and view-invariant nature of skeleton data.
Quanyu Wang, Kaixiang Zhang, Manjotho Ali Asghar   +2 more
doaj   +1 more source

Label Propagation-Based Parallel Graph Partitioning for Large-Scale Graph Data

IEEE Access, 2020
The increasing importance of graph data in various fields requires large-scale graph data to be processed efficiently. Furthermore, well-balanced graph partitioning is a vital component of parallel/distributed graph processing.
Minho Bae, Minjoong Jeong, Sangyoon Oh
doaj   +1 more source