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 176–200 of 208 papers

TitleStatusHype
PyTorch-BigGraph: A Large-scale Graph Embedding SystemCode0
FairGP: A Scalable and Fair Graph Transformer Using Graph PartitioningCode0
Learning Spatial Context with Graph Neural Network for Multi-Person Pose GroupingCode0
Learning Space Partitions for Nearest Neighbor SearchCode0
DistDGL: Distributed Graph Neural Network Training for Billion-Scale GraphsCode0
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex HullsCode0
BClean: A Bayesian Data Cleaning SystemCode0
Leveraging Domain Knowledge to Improve Microscopy Image Segmentation with Lifted MulticutsCode0
Local Motif Clustering via (Hyper)Graph PartitioningCode0
Scalable Gromov-Wasserstein Learning for Graph Partitioning and MatchingCode0
A 3D Convolutional Approach to Spectral Object Segmentation in Space and TimeCode0
GAP: Generalizable Approximate Graph Partitioning FrameworkCode0
Generalizable Resource Allocation in Stream Processing via Deep Reinforcement LearningCode0
Random Projection Forest Initialization for Graph Convolutional NetworksCode0
Demystifying Distributed Training of Graph Neural Networks for Link PredictionCode0
Random projection tree similarity metric for SpectralNetCode0
Approximate spectral clustering with eigenvector selection and self-tuned kCode0
Approximate spectral clustering density-based similarity for noisy datasetsCode0
Graph Construction using Principal Axis Trees for Simple Graph ConvolutionCode0
Towards the efficacy of federated prediction for epidemics on networksCode0
Deep Spectral Improvement for Unsupervised Image Instance SegmentationCode0
Creating Multi-Level Skill Hierarchies in Reinforcement LearningCode0
Refining a k-nearest neighbor graph for a computationally efficient spectral clusteringCode0
Refining a -nearest neighbor graph for a computationally efficient spectral clusteringCode0
A random-key GRASP for combinatorial optimizationCode0
Show:102550
← PrevPage 8 of 9Next →

No leaderboard results yet.