Results 11 to 20 of about 36,227 (305)

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

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   +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 partitioning: an updated survey

AKCE International Journal of Graphs and Combinatorics, 2023
Graph partitioning problem, which is one of the most important topics in graph theory, usually asks for a partition of the vertex set of a graph into pairwise disjoint subsets with various requirements. It comes from the well-known Max-Cut Problem: Given
Shufei Wu, Jianfeng Hou
doaj   +2 more sources

A Graph-based Benchmark dataset for Printed Circuit Netlist Partitioning [PDF]

Scientific Data
As a critical component of electronic design automation and reverse engineering, printed circuit netlist partitioning has long been a significant research topic in this field.
Jie Yang, Kai Qiao, Jian Chen, Jinjin Hai, Jun Shu, Yuena Wei, Bin Yan   +6 more
doaj   +2 more sources

Heterogeneous Environment Aware Streaming Graph Partitioning

IEEE Transactions on Knowledge and Data Engineering, 2015
With the increasing availability of graph data and widely adopted cloud computing paradigm, graph partitioning has become an efficient pre-processing technique to balance the computing workload and cope with the large scale of input data.
Bin Cui, Zi Huang, Yingxia Shao
exaly   +2 more sources

Multilevel graph partitioning: an evolutionary approach

Journal of the Operational Research Society, 2005
The graph partitioning problem is defined as that of dividing the vertices of an undirected graph into a set of balanced parts through the removal of a set of edges, whose size is to be minimized.
Faruk Polat
exaly   +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

Clique-partitioned graphs [PDF]

Discrete Applied Mathematics, 2022
A graph $G$ of order $nv$ where $n\geq 2$ and $v\geq 2$ is said to be weakly $(n,v)$-clique-partitioned if its vertex set can be decomposed in a unique way into $n$ vertex-disjoint $v$-cliques. It is strongly $(n,v)$-clique-partitioned if in addition, the only $v$-cliques of $G$ are the $n$ cliques in the decomposition.
Grahame Erskine, Terry S. Griggs, Jozef Sirán   +2 more
openaire   +3 more sources