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
Correlation clustering with local objectives—0
COSINE: Compressive Network Embedding on Large-scale Information Networks—0
Cross-Document Co-Reference Resolution using Sample-Based Clustering with Knowledge Enrichment—0
Data Clustering and Graph Partitioning via Simulated Mixing—0
Deep Affinity Net: Instance Segmentation via Affinity—0
Deep Learning and Spectral Embedding for Graph Partitioning—0
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks—0
DistGNN: Scalable Distributed Training for Large-Scale Graph Neural Networks—0
Distributed Compressed Sparse Row Format for Spiking Neural Network Simulation, Serialization, and Interoperability—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
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 8 of 9Next →

No leaderboard results yet.