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 41–50 of 208 papers

TitleStatusHype
BClean: A Bayesian Data Cleaning SystemCode0
NeuroCUT: A Neural Approach for Robust Graph PartitioningCode0
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO Systems—0
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks—0
An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training—0
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design—0
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex HullsCode0
Self-supervised Few-shot Learning for Semantic Segmentation: An Annotation-free ApproachCode1
Spectral Normalized-Cut Graph Partitioning with Fairness ConstraintsCode0
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm—0
Show:102550
← PrevPage 5 of 21Next →

No leaderboard results yet.