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 51100 of 208 papers

TitleStatusHype
Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant0
Uplifting the Expressive Power of Graph Neural Networks through Graph Partitioning0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning0
BClean: A Bayesian Data Cleaning SystemCode0
NeuroCUT: A Neural Approach for Robust Graph PartitioningCode0
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO Systems0
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks0
An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training0
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design0
Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex HullsCode0
Spectral Normalized-Cut Graph Partitioning with Fairness ConstraintsCode0
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm0
PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks0
BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs0
Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints0
Creating Multi-Level Skill Hierarchies in Reinforcement LearningCode0
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues0
One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering0
Distributed Compressed Sparse Row Format for Spiking Neural Network Simulation, Serialization, and Interoperability0
Inductive Graph UnlearningCode0
Distributed Graph Embedding with Information-Oriented Random WalksCode0
A parameter-free graph reduction for spectral clustering and SpectralNetCode0
Random projection tree similarity metric for SpectralNetCode0
Refining a k-nearest neighbor graph for a computationally efficient spectral clusteringCode0
Approximate spectral clustering with eigenvector selection and self-tuned kCode0
Graph Construction using Principal Axis Trees for Simple Graph ConvolutionCode0
Approximate spectral clustering density-based similarity for noisy datasetsCode0
Random Projection Forest Initialization for Graph Convolutional NetworksCode0
Fair and skill-diverse student group formation via constrained k-way graph partitioning0
Scalable Graph Convolutional Network Training on Distributed-Memory Systems0
AGO: Boosting Mobile AI Inference Performance by Removing Constraints on Graph Optimization0
Sub-Graph Learning for Spatiotemporal Forecasting via Knowledge Distillation0
Agglomeration of Polygonal Grids using Graph Neural Networks with applications to Multigrid solvers0
Robust Fair Clustering: A Novel Fairness Attack and Defense FrameworkCode0
Fine-tuning Partition-aware Item Similarities for Efficient and Scalable RecommendationCode0
Nimble GNN Embedding with Tensor-Train Decomposition0
Neural Improvement Heuristics for Graph Combinatorial Optimization ProblemsCode0
More Recent Advances in (Hyper)Graph Partitioning0
Local Motif Clustering via (Hyper)Graph PartitioningCode0
A Bayesian Approach To Graph Partitioning0
WawPart: Workload-Aware Partitioning of Knowledge Graphs0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks0
Generalized Spectral Clustering for Directed and Undirected Graphs0
SUGAR: Efficient Subgraph-level Training via Resource-aware Graph Partitioning0
Deep Learning and Spectral Embedding for Graph Partitioning0
Trading Quality for Efficiency of Graph Partitioning: An Inductive Method across Graphs0
A Design Flow for Mapping Spiking Neural Networks to Many-Core Neuromorphic Hardware0
Stateless actor-critic for instance segmentation with high-level priors0
xER: An Explainable Model for Entity Resolution using an Efficient Solution for the Clique Partitioning Problem0
_2-norm Flow Diffusion in Near-Linear Time0
Show:102550
← PrevPage 2 of 5Next →

No leaderboard results yet.