Results 1 to 10 of about 175,549 (222)
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 +5 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 +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.
Erskine, Grahame +2 more
openaire +2 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
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
Partitions of Graphs into Cographs
Electronic Notes in Discrete Mathematics, 2002 AbstractCographs form the minimal family of graphs containing K1 that is closed with respect to complementation and disjoint union. We discuss vertex partitions of graphs into the smallest number of cographs. We introduce a new parameter, calling the minimum order of such a partition the c-chromatic number of the graph. We begin by axiomatizing several
Jaroslav Nesetril, John Gimbel
openaire +3 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
Cuadrado, F +4 more
core +2 more sources
Chromatic partitions of a graph
Discrete Mathematics, 1989 AbstractLet χ(G) be the chromatic number of a graph G=(V,E), and k⩾1 be an integer. The general chromatic number χk(G) of G is the minimum order of a partition P of V such that each set in P induces a subgraph H with χ(H)⩽k. This paper initiates a study of χk(G) and generalizes various known results on χ(G).
E. Sampathkumar, C. V. Venkatachalam
openaire +2 more sources
Genetic algorithms for graph partitioning and incremental graph partitioning
Proceedings of Supercomputing '94, 1994 Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing. This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude improvement over traditional ...
Maini, Harpal +3 more
openaire +4 more sources
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