Results 11 to 20 of about 193,029 (263)
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
Deep Multilevel Graph Partitioning
29th Annual European Symposium on Algorithms (ESA 2021), 2021 Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particular, the problem is a building block in applications that require parallel processing. While the amount of available cores in parallel architectures has significantly increased
Gottesbüren, Lars +4 more
openaire +6 more sources
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
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 +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
Cuadrado, F +4 more
core +2 more sources
Buffered Streaming Graph Partitioning
ACM Journal of Experimental Algorithmics, 2022 Partitioning graphs into blocks of roughly equal size is a widely used tool when processing large graphs. Currently, there is a gap observed in the space of available partitioning algorithms. On the one hand, there are streaming algorithms that have been adopted to partition massive graph data on small machines.
Marcelo Fonseca Faraj, Christian Schulz
openaire +3 more sources
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
Revisiting the Isoperimetric Graph Partitioning Problem
IEEE Access, 2019 Isoperimetric graph partitioning, which is also known as the Cheeger cut, is NP-hard in its original form. In the literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications. In the
Sravan Danda +3 more
doaj +1 more source
A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm [PDF]
, 2018 We propose a novel block-row partitioning method in order to improve the convergence rate of the block Cimmino algorithm for solving general sparse linear systems of equations.
Aykanat, Cevdet +2 more
core +2 more sources