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

TitleStatusHype
FGPGA: An Efficient Genetic Approach for Producing Feasible Graph Partitions—0
Fine-Grained Bipartite Concept Factorization for Clustering—0
Flow-Based Algorithms for Local Graph Clustering—0
From Free Text to Clusters of Content in Health Records: An Unsupervised Graph Partitioning Approach—0
From Text to Topics in Healthcare Records: An Unsupervised Graph Partitioning Methodology—0
Generalized Spectral Clustering for Directed and Undirected Graphs—0
GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs—0
GNNIE: GNN Inference Engine with Load-balancing and Graph-Specific Caching—0
Show:102550
← PrevPage 5 of 5Next →

No leaderboard results yet.