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 11–20 of 208 papers

TitleStatusHype
Accurate and versatile 3D segmentation of plant tissues at cellular resolutionCode1
Reformulating DOVER-Lap Label Mapping as a Graph Partitioning ProblemCode1
Task-specific Scene Structure RepresentationsCode1
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor SearchCode1
A Structure-Aware Framework for Learning Device Placements on Computation GraphsCode1
Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate CommunicationCode1
RAMA: A Rapid Multicut Algorithm on GPUCode1
Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and SimplicityCode1
A Clustering Method with Graph Maximum Decoding Information—0
Algorithms for metric learning via contrastive embeddings—0
Show:102550
← PrevPage 2 of 21Next →

No leaderboard results yet.