SOTAVerified

graph partitioning

Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 141–150 of 208 papers

TitleStatusHype
xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem—0
3D Cell Nuclei Segmentation with Balanced Graph Partitioning—0
A Bayesian Approach To Graph Partitioning—0
Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning—0
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design—0
A Clustering Method with Graph Maximum Decoding Information—0
A Design Flow for Mapping Spiking Neural Networks to Many-Core Neuromorphic Hardware—0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks—0
GASP, a generalized framework for agglomerative clustering of signed graphs and its application to Instance Segmentation—0
Agglomeration of Polygonal Grids using Graph Neural Networks with applications to Multigrid solvers—0
Show:102550
← PrevPage 15 of 21Next →

No leaderboard results yet.