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 151–160 of 208 papers

TitleStatusHype
AGO: Boosting Mobile AI Inference Performance by Removing Constraints on Graph Optimization—0
A Graph-Partitioning Based Continuous Optimization Approach to Semi-supervised Clustering Problems—0
Algorithms for metric learning via contrastive embeddings—0
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem—0
A new cut-based genetic algorithm for graph partitioning applied to cell formation—0
An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training—0
An Incremental Reseeding Strategy for Clustering—0
Unsupervised Optimisation of GNNs for Node Clustering—0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning—0
A Performance Guarantee for Spectral Clustering—0
Show:102550
← PrevPage 16 of 21Next →

No leaderboard results yet.