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 121–130 of 208 papers

TitleStatusHype
Initialization for Network Embedding: A Graph Partition Approach—0
Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints—0
Efficient Video Segmentation Using Parametric Graph Partitioning—0
_2-norm Flow Diffusion in Near-Linear Time—0
Endurance-Aware Mapping of Spiking Neural Networks to Neuromorphic Hardware—0
Engineering a direct k-way Hypergraph Partitioning Algorithm—0
Evolutionary Acyclic Graph Partitioning—0
Fair and skill-diverse student group formation via constrained k-way graph partitioning—0
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues—0
FastGAS: Fast Graph-based Annotation Selection for In-Context Learning—0
Show:102550
← PrevPage 13 of 21Next →

No leaderboard results yet.