Results 11 to 20 of about 190,829 (309)
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
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.
Erskine, Grahame +2 more
openaire +2 more sources
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
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 +2 more
doaj +1 more source
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
openaire +3 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 +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
On the path partition of graphs
Opuscula Mathematica, 2023 Let \(G\) be a graph of order \(n\). The maximum and minimum degree of \(G\) are denoted by \(\Delta\) and \(\delta\), respectively. The path partition number \(\mu(G)\) of a graph \(G\) is the minimum number of paths needed to partition the vertices of \(G\).
Mekkia Kouider, Mohamed Zamime
openaire +2 more sources
Standard Framework for Comparison of Graph Partitioning Techniques
JISR on Computing, 2015 Graph Partitioning is used to distribute graph partitions across nodes for processing. It is very important in the pre-processing step for distributed graph processing.
Mudasser Iqbal, Saif-ur-Rahman
doaj +1 more source
Judicious partitions of graphs [PDF]
Periodica Mathematica Hungarica, 1993 Let \(G\) be a graph and let \(e(G[V_ i])\) be the number of edges of the subgraph of \(G\) induced by \(V_ i\). Set \(p_ k(G) = \min (\max_{1 \leq i \leq k} e(G[V_ i]))\) where the minimum is taken over all partitions \(V_ 1, \dots, V_ k\) of the vertex set of \(G\) into \(k\) sets. It is proved that \(p_ k(G) \leq e(G) / {k+1 \choose 2}\).
Bollobás, B, Scott, A
openaire +2 more sources