Results 21 to 30 of about 36,227 (305)
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
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
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
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 +1 more source
Partitions of Graphs into Cographs
Electronic Notes in Discrete Mathematics, 2002 A cograph is a graph that can be constructed by a single vertex using complementation and disjoint union operations. Equivalently, cographs are exactly those graphs which do not contain an induced path \(P_4\) with four vertices and three edges. The \(c\)-chromatic number \(c(G)\) of a graph \(G\) is the minimum number \(k\) such that the vertex set of
John Gimbel, Jaroslav Nesetril
openaire +2 more sources
Partitions in Matrices and Graphs
European Journal of Combinatorics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel R. Hughes, Navin M. Singhi
openaire +1 more source
GAP: Genetic Algorithm Based Large-Scale Graph Partition in Heterogeneous Cluster
IEEE Access, 2020 Graph is an important model to describe various networks, and its scale becomes larger and larger with the development of communication and information technology.
Menghan Li +3 more
doaj +1 more source
Chromatic partitions of a graph
Discrete Mathematics, 1989 The chromatic partition number \(\chi_ k(G)\) (k\(\geq 1)\) of a graph G is defined to be the minimum number of colours needed in a \(P_ k\)- colouring of G. The following are the main results: (1) For any graph G of order p, \[ \frac{p}{M_ k}\leq \chi_ k(G)\leq \{\frac{p-M_ k}{k}\}+1\quad and\quad -\frac{p}{\beta_ 0k}\leq \chi_ k(G)\leq \{\frac{p ...
E. Sampathkumar 0001 +1 more
openaire +1 more source