Results 11 to 20 of about 768,033 (273)
Network partitioning techniques based on network natural properties for power system application [PDF]
, 2002 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 10/04/2002.In this thesis, the problem of partitioning a network into interconnected sub-networks is addressed. The goal is to achieve a partitioning which
Alkhelaiwi, Ali Mani Turki
core +7 more sources
Adaptive Partitioning for Large-Scale Dynamic Graphs [PDF]
, 2013 —In the last years, large-scale graph processing has gained increasing attention, with most recent systems placing particular emphasis on latency. One possible technique to improve runtime performance in a distributed graph processing system is to reduce
Martella, Claudio +13 more
core +4 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
openaire +4 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
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
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
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
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