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. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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.
Papers archive 2025-07-28
archive papers tagged: 208 · with a code link: 69 · where Syntology ran a sample: 11 (11 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (11 of 208 tagged: 11 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 3: papers 1 to 100 of 208, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
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 official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified (of 9 harvested samples) · 2 pointer-only (licence)In 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 official (archive's flag): 6 ran · 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 8 harvested samples)The 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 official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)Large-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 official (archive's flag): 8 ran · 8 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified (of 13 harvested samples) · 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 official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)By 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, 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 listedWe introduce a graph reduction method that does not require any parameters.
-
25 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
22 Feb 2023 1 repository listed
-
2 Jan 2023 1 repository listed
-
4 Oct 2022 1 repository listed
-
13 Jul 2022 1 repository listed
-
1 Jun 2022 1 repository listed
-
27 May 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 3 harvested samples)
-
16 May 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified (of 5 harvested samples) · 5 pointer-only (licence)
-
11 May 2022 1 repository listed
-
22 Mar 2022 1 repository listed
-
4 Sep 2021 1 repository listed
-
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks8 Apr 2021 1 repository listed
-
6 Apr 2021 1 repository listed
-
5 Apr 2021 1 repository listed
-
30 Mar 2021 1 repository listed Syntology official (archive's flag): 9 ran · 10 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified (of 12 harvested samples) · 12 pointer-only (licence)
-
6 Feb 2021 1 repository listed
-
1 Feb 2021 1 repository listed
-
11 Oct 2020 1 repository listed
-
29 Jul 2020 1 repository listed
-
7 Jun 2020 1 repository listed
-
1 Dec 2019 1 repository listed
-
19 Nov 2019 1 repository listed
-
5 Jul 2019 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples)
-
25 May 2019 1 repository listed
-
18 May 2019 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)
-
28 Mar 2019 1 repository listed
-
2 Mar 2019 1 repository listed
-
24 Jan 2018 1 repository listed
-
1 Jan 2017 1 repository listed
-
1 Dec 2016 1 repository listed
-
18 Apr 2014 1 repository listed
-
1 Oct 2012 1 repository listed
-
3 Oct 2011 1 repository listed
-
7 Aug 2002 1 repository listed
-
Divide by Question, Conquer by Agent: SPLIT-RAG with Question-Driven Graph Partitioning20 May 2025 0 repositories listed
-
A Graph-Partitioning Based Continuous Optimization Approach to Semi-supervised Clustering Problems6 Mar 2025 0 repositories listed
-
Node-level Contrastive Unlearning on Graph Neural Networks4 Mar 2025 0 repositories listed
-
WaveGAS: Waveform Relaxation for Scaling Graph Neural Networks27 Feb 2025 0 repositories listed
-
Dual-Bounded Nonlinear Optimal Transport for Size Constrained Min Cut Clustering30 Jan 2025 0 repositories listed
-
Attribute-Enhanced Similarity Ranking for Sparse Link Prediction29 Nov 2024 0 repositories listed
-
Graph Neural Networks on Graph Databases18 Nov 2024 0 repositories listed
-
A Random-Key Optimizer for Combinatorial Optimization6 Nov 2024 0 repositories listed
-
VLSI Hypergraph Partitioning with Deep Learning2 Sep 2024 0 repositories listed
-
Quantum Annealing based Power Grid Partitioning for Parallel Simulation7 Aug 2024 0 repositories listed
-
LSM-GNN: Large-scale Storage-based Multi-GPU GNN Training by Optimizing Data Transfer Scheme21 Jul 2024 0 repositories listed
-
Distributed Training of Large Graph Neural Networks with Variable Communication Rates25 Jun 2024 0 repositories listed
-
FastGAS: Fast Graph-based Annotation Selection for In-Context Learning6 Jun 2024 0 repositories listed
-
CATGNN: Cost-Efficient and Scalable Distributed Training for Graph Neural Networks2 Apr 2024 0 repositories listed
-
A Clustering Method with Graph Maximum Decoding Information18 Mar 2024 0 repositories listed
-
Unsupervised Optimisation of GNNs for Node Clustering12 Feb 2024 0 repositories listed
-
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem6 Feb 2024 0 repositories listed
-
Circuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning31 Jan 2024 0 repositories listed
-
GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs6 Jan 2024 0 repositories listed
-
Fine-Grained Bipartite Concept Factorization for Clustering1 Jan 2024 0 repositories listed
-
Large Scale Training of Graph Neural Networks for Optimal Markov-Chain Partitioning Using the Kemeny Constant22 Dec 2023 0 repositories listed
-
Uplifting the Expressive Power of Graph Neural Networks through Graph Partitioning14 Dec 2023 0 repositories listed
-
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning11 Dec 2023 0 repositories listed
-
Mitigating Pilot Contamination and Enabling IoT Scalability in Massive MIMO Systems5 Oct 2023 0 repositories listed
-
DGC: Training Dynamic Graphs with Spatio-Temporal Non-Uniformity using Graph Partitioning by Chunks7 Sep 2023 0 repositories listed
-
An Experimental Comparison of Partitioning Strategies for Distributed Graph Neural Network Training29 Aug 2023 0 repositories listed
-
Accelerating Generic Graph Neural Networks via Architecture, Compiler, Partition Method Co-Design16 Aug 2023 0 repositories listed
-
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm19 Jul 2023 0 repositories listed
-
PolicyClusterGCN: Identifying Efficient Clusters for Training Graph Convolutional Networks25 Jun 2023 0 repositories listed
-
BatchGNN: Efficient CPU-Based Distributed GNN Training on Very Large Graphs23 Jun 2023 0 repositories listed
-
Efficient Partitioning Method of Large-Scale Public Safety Spatio-Temporal Data based on Information Loss Constraints22 Jun 2023 0 repositories listed
Syntology lines on 11 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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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