Results 31 to 40 of about 190,829 (309)
Improved Cheeger's Inequality: Analysis of Spectral Partitioning Algorithms through Higher Order Spectral Gap [PDF]
, 2013 Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1
Gharan, Shayan Oveis +4 more
core +3 more sources
Dynamic Balanced Graph Partitioning
, 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 +1 more source
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
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
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
Hypergraph partitioning using tensor eigenvalue decomposition.
PLoS ONE, 2023 Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturing super-dyadic interactions among entities.
Deepak Maurya, Balaraman Ravindran
doaj +1 more source
Enhanced adaptive partitioning in a distributed graph database
Journal of Information and Telecommunication, 2021 Nowadays, open-source graph databases do not include an inherent mechanism for data relocation that would be based on their usage. They often do not offer even appropriate monitoring that could help to make such a decision.
Lucie Svitáková +2 more
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 ...
Peter J. Cameron, Sebastian M. Cioabă
openaire +3 more sources
Partitioning Graph Clustering With User-Specified Density
IEEE Access, 2023 Graph clustering has attracted many interests in recent years, with numerous applications ranging from the clustering of computer networks to the detection of social communities.
Rohi Tariq +3 more
doaj +1 more source
Window-based Streaming Graph Partitioning Algorithm
, 2019 In the recent years, the scale of graph datasets has increased to such a degree that a single machine is not capable of efficiently processing large graphs.
Abdolrashidi A. +5 more
core +1 more source