Results 31 to 40 of about 36,227 (305)

Boosting graph computation with generic methods: partitioning and incrementalization [PDF]

, 2021
In this thesis we develop a package of generic methods for boosting the velocity of graph computations, regarding partitioning and incrementalization. The former is to deal with the challenges of volume and velocity over big data, and make computations
Xu, Ruiqi
core   +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, Aditya Challa, B. S. Daya Sagar, Laurent Najman   +3 more
doaj   +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

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, Rong Zhou, Zhou, Rong, Hansen, Eric, Hansen, Eric A.   +4 more
core   +1 more source

A Graph Partition Problem

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

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, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson   +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, Gottesbüren, Lars, Schulz, Christian, Seemaier, Daniel, Heuer, Tobias   +4 more
core   +1 more source

Design of Heterogeneous Graph Computing System for Large-Scale Dynamic Graph [PDF]

Jisuanji gongcheng
Graphics 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

Algorithms for partitioning logical circuits into subcircuits

Informatika, 2020
The problem of partitioning a logical circuit into subcircuits is considered. It is of great importance when performing optimization transformations in the process of circuit synthesis.
N. A. Kirienko
doaj   +1 more source