Results 1 to 10 of about 197,409 (310)
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 +3 more
doaj +4 more sources
Graph Partitions in Chemistry [PDF]
Entropy, 2023 We study partitions (equitable, externally equitable, or other) of graphs that describe physico-chemical systems at the atomic or molecular level; provide examples that show how these partitions are intimately related with symmetries of the systems; and discuss how such a link can further lead to insightful relations with the systems’ physical and ...
Ioannis Michos, Vasilios Raptis
openalex +4 more sources
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 +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 +4 more
doaj +2 more sources
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 +2 more
openalex +4 more sources
A social network graph partitioning algorithm based on double deep Q-Network [PDF]
Scientific ReportsWith 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 +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 +44 more
core +3 more sources
Sigma Partitioning: Complexity and Random Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A $\textit{sigma partitioning}$ of a graph $G$ is a partition of the vertices into sets $P_1, \ldots, P_k$ such that for every two adjacent vertices $u$ and $v$ there is an index $i$ such that $u$ and $v$ have different numbers of neighbors in $P_i$. The
Ali Dehghan +2 more
doaj +3 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 +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 +5 more
doaj +1 more source