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

Showing 3140 of 208 papers

TitleStatusHype
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex HullsCode0
FairGP: A Scalable and Fair Graph Transformer Using Graph PartitioningCode0
GAP: Generalizable Approximate Graph Partitioning FrameworkCode0
Graph Construction using Principal Axis Trees for Simple Graph ConvolutionCode0
Characterizing and comparing external measures for the assessment of cluster analysis and community detectionCode0
Causal Discovery over High-Dimensional Structured Hypothesis Spaces with Causal Graph PartitioningCode0
Fine-tuning Partition-aware Item Similarities for Efficient and Scalable RecommendationCode0
Distributed Evolutionary Graph PartitioningCode0
Distributed Graph Embedding with Information-Oriented Random WalksCode0
Ego-splitting Framework: from Non-Overlapping to Overlapping ClustersCode0
Show:102550
← PrevPage 4 of 21Next →

No leaderboard results yet.