Results 21 to 30 of about 36,530 (307)
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
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
GraSP: distributed streaming graph partitioning [PDF]
, 2015 This paper presents a distributed, streaming graph parti- tioner, Graph Streaming Partitioner (GraSP), which makes partition decisions as each vertex is read from memory, sim- ulating an online algorithm that must process nodes as they arrive.
Pienta, Pienta +5 more
core +1 more source
RBSEP: a reassignment and buffer based streaming edge partitioning approach
Journal of Big Data, 2019 In recent years, the rapid growth of the Internet has led to creation of massively large graphs. Since databases have become very large nowadays, they cannot be processed by a simple machine at an acceptable time anymore; therefore, traditional graph ...
Monireh Taimouri, Hamid Saadatfar
doaj +1 more source
The American Mathematical Monthly, 2015 Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$}, such that the set $M(G)$ of values of $m$ for which such a partition exists consists of all but finitely many ...
Sebastian M. Cioaba, Peter J. Cameron
openaire +2 more sources
Dynamic State-Space Partitioning in External-Memory Graph Search [PDF]
, 2010 State-of-the-art external-memory graph search algorithms rely on a hash function, or equivalently, a state-space projection function, that partitions the stored nodes of the state-space search graph into groups of nodes that are stored as separate ...
Eric A. Hansen +4 more
core +1 more source
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Algorithms, 2019 The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article.
Hristo N. Djidjev +4 more
doaj +1 more source
Deep Multilevel Graph Partitioning [PDF]
, 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.
Sanders, Peter +4 more
core +1 more source
Design of Heterogeneous Graph Computing System for Large-Scale Dynamic Graph [PDF]
Jisuanji gongchengGraphics Processing Unit (GPU) is not fully utilized when processing large-scale dynamic graphs, and the limitations of GPU-oriented graph partitioning methods lead to performance bottlenecks.
ZHANG Ming, GUO Wenkang, WANG Haifeng
doaj +1 more source
Scalable graph partitioning for distributed graph processing [PDF]
, 2019 Distributed graph processing systems such as Pregel, PowerGraph, or GraphX have gained popularity due to their superior performance of data analytics on graph-structured data such as social networks, web document graphs, and biological networks.
Mayer, Christian
core +1 more source