Browse State-of-the-Art › graph partitioning
graph partitioning
69 papers with code · 1 benchmark · 2 datasets archive 2025-07-28
Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| custom (1 row) | GAP | GAP: Generalizable Approximate Graph Partitioning Framework | code | — | Compare |
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
2 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 69 papers with code (208 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
15 Jul 2025 2 repositories listedSpatiotemporal graph neural networks (ST-GNNs) are powerful tools for modeling spatial and temporal data dependencies.
-
12 Mar 2024 2 repositories listed Syntology ran 6 of 9 samples · 3 unverifiedIn this paper, we introduce VoteCut, an innovative method for unsupervised object discovery that leverages feature representations from multiple self-supervised models.
-
4 Feb 2024 2 repositories listedThis paper addresses the fact that not all channels of the feature map extracted from a self-supervised backbone contain sufficient information for instance segmentation purposes.
-
14 Aug 2023 2 repositories listedThird, we compute the complexity of the convex hulls in hyperbolic spaces to assess the extent of data leakage; at the same time, in order to limit communication cost for the hulls, we propose a new quantization method…
-
24 Jun 2020 2 repositories listed Syntology ran 0 of 8 samples · 8 unverifiedThe selection of coarse-grained (CG) mapping operators is a critical step for CG molecular dynamics (MD) simulation.
-
24 Sep 2019 2 repositories listedWe demonstrate the efficacy of the graph-partitioning-based DCRNN approach to model the traffic on a large California highway network with 11, 160 sensor locations.
-
13 Aug 2017 2 repositories listedMore precisely, our framework works in two steps: a local ego-net analysis phase, and a global graph partitioning phase .
-
25 Jun 2025 1 repository listedThis paper demystifies distributed training of GNNs for link prediction by investigating the issue of performance degradation when each worker trains a GNN on its assigned partitioned subgraph without having access to…
-
28 May 2025 1 repository listed Syntology ran 0 of 1 samples · 1 unverifiedLarge-scale atomistic simulations are essential to bridge computational materials and chemistry to realistic materials and drug discovery applications.
-
13 Jan 2025 1 repository listedSuperpixel segmentation is a foundation for many higher-level computer vision tasks, such as image segmentation, object recognition, and scene understanding.
-
14 Dec 2024 1 repository listedWe found that the sensitive features of higher-order nodes disproportionately influence lower-order nodes, resulting in sensitive feature bias.
-
3 Dec 2024 1 repository listedEpidemic prediction is of practical significance in public health, enabling early intervention, resource allocation, and strategic planning.
-
20 Oct 2024 1 repository listedThe features of self-supervised vision transformers (ViTs) contain strong semantic and positional information relevant to downstream tasks like object localization and segmentation.
-
1 Sep 2024 1 repository listedGraph partitioning (GP) is a classic problem that divides the node set of a graph into densely-connected blocks.
-
27 Aug 2024 1 repository listedIn this work, we propose an unsupervised method by reframing the video frame segmentation as a graph partitioning problem and regarding image pixels as graph nodes, which is significantly different from the previous…
-
10 Jun 2024 1 repository listedIn this paper, we define a novel causal graph partition that allows for divide-and-conquer causal discovery with theoretical guarantees.
-
29 May 2024 1 repository listedA random-key optimizer (RKO) uses a vector of random keys to encode a solution to a combinatorial optimization problem.
-
23 May 2024 1 repository listedComputation graphs are Directed Acyclic Graphs (DAGs) where the nodes correspond to mathematical operations and are used widely as abstractions in optimizations of neural networks.
-
17 Apr 2024 1 repository listed Syntology ran 8 of 13 samples · 5 unverified · 13 pointer-only (licence)Our objective is to train a generative model that can simultaneously provide a score indicating the presence of shared key point between a pair of arguments and generate the shared key point.
-
4 Mar 2024 1 repository listedIn particular, our new routing methods enable the use of balanced graph partitioning, which is a high-quality partitioning method without a naturally associated routing algorithm.
-
16 Feb 2024 1 repository listedConventional fair graph clustering methods face two primary challenges: i) They prioritize balanced clusters at the expense of cluster cohesion by imposing rigid constraints, ii) Existing methods of both individual and…
-
11 Nov 2023 1 repository listedBy evaluating on both real-world and synthetic datasets, we demonstrate that BClean is capable of achieving an F-measure of up to 0.
-
18 Oct 2023 1 repository listedSecond, we decouple the parameter space and the partition count making NeuroCUT inductive to any unseen number of partition, which is provided at query time.
-
26 Jul 2023 1 repository listedThis approach eliminates the need for manual annotation, making it particularly suitable for medical images with limited annotated data.
-
22 Jul 2023 1 repository listedNormalized-cut graph partitioning aims to divide the set of nodes in a graph into k disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters.
-
18 Jun 2023 1 repository listed Syntology ran 1 of 1 samples · 0 unverifiedBy dividing giant graph data, we build multiple independently and parallelly trained weaker GNNs (soup ingredient) without any intermediate communication, and combine their strength using a greedy interpolation soup…
-
16 Jun 2023 1 repository listedWhat is a useful skill hierarchy for an autonomous agent?
-
6 Apr 2023 1 repository listedTo extend machine unlearning to graph data, \textit{GraphEraser} has been proposed.
-
28 Mar 2023 1 repository listedGraph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in machine learning tasks.
-
25 Feb 2023 1 repository listedOur experiments revealed that SpectralNet produces better clustering accuracy using rpTree similarity metric compared to k-nn graph with a distance metric.
Syntology lines on 5 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections