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 111–120 of 208 papers

TitleStatusHype
WaveGAS: Waveform Relaxation for Scaling Graph Neural Networks—0
WawPart: Workload-Aware Partitioning of Knowledge Graphs—0
Weighted Laplacian and Its Theoretical Applications—0
The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning—0
Distributed Power-law Graph Computing: Theoretical and Empirical Analysis—0
Distributed Training of Graph Convolutional Networks using Subgraph Approximation—0
Distributed Training of Large Graph Neural Networks with Variable Communication Rates—0
Divide by Question, Conquer by Agent: SPLIT-RAG with Question-Driven Graph Partitioning—0
Dual-Bounded Nonlinear Optimal Transport for Size Constrained Min Cut Clustering—0
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm—0
Show:102550
← PrevPage 12 of 21Next →

No leaderboard results yet.