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 151–160 of 208 papers

TitleStatusHype
Improved Image Boundaries for Better Video Segmentation—0
Incorporating Road Networks into Territory Design—0
Integrating Graph Partitioning and Matching for Trajectory Analysis in Video Surveillance—0
Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games—0
Joint Semantic Instance Segmentation on Graphs with the Semantic Mutex Watershed—0
Kernel k-Groups via Hartigan's Method—0
Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant—0
Learning Communities in the Presence of Errors—0
Distributed Graph Embedding with Information-Oriented Random WalksCode0
A Min-max Cult Algorithm for Graph Partitioning and Data ClusteringCode0
Show:102550
← PrevPage 16 of 21Next →

No leaderboard results yet.