{"url":"/task/graph-partitioning","name":"graph partitioning","slug":"graph-partitioning","description_markdown":"Graph Partitioning is generally the first step of distributed graph computing tasks. The targets are load-balance and minimizing the communication volume.","categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":208,"papers_with_code":69,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":2,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/graph-partitioning-on-custom-1","slug":"graph-partitioning-on-custom-1","dataset":"custom","dataset_url":null,"rows_in_archive":1,"metrics":["All"],"first_row_in_archive_order":{"model":"GAP","paper_title":"GAP: Generalizable Approximate Graph Partitioning Framework","paper_url":"/paper/gap-generalizable-approximate-graph","paper_date":"2019-03-02","arxiv_id":"1903.00614","code_links":[{"title":"saurabhdash/GCN_Partitioning","url":"https://github.com/saurabhdash/GCN_Partitioning"}],"syntology":null}}],"datasets":[{"url":"/dataset/a-collection-of-lfr-benchmark-graphs","name":"A collection of LFR benchmark graphs","full_name":"","num_papers_in_archive":1},{"url":"/dataset/ham","name":"HAM","full_name":"Human-annotated Mappings","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":69,"tagged_in_all":208,"items":[{"url":"/paper/pgt-i-scaling-spatiotemporal-gnns-with-memory","title":"PGT-I: Scaling Spatiotemporal GNNs with Memory-Efficient Distributed Training","date":"2025-07-15","arxiv_id":"2507.11683","repositories_listed":2,"syntology":null},{"url":"/paper/cuvler-enhanced-unsupervised-object","title":"CuVLER: Enhanced Unsupervised Object Discoveries through Exhaustive Self-Supervised Transformers","date":"2024-03-12","arxiv_id":"2403.07700","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_unverified":3,"n_pointer_only":0}},{"url":"/paper/deep-spectral-improvement-for-unsupervised","title":"Deep Spectral Improvement for Unsupervised Image Instance Segmentation","date":"2024-02-04","arxiv_id":"2402.02474","repositories_listed":2,"syntology":null},{"url":"/paper/federated-classification-in-hyperbolic-spaces","title":"Federated Classification in Hyperbolic Spaces via Secure Aggregation of Convex Hulls","date":"2023-08-14","arxiv_id":"2308.06895","repositories_listed":2,"syntology":null},{"url":"/paper/graph-neural-network-based-coarse-grained","title":"Graph Neural Network Based Coarse-Grained Mapping Prediction","date":"2020-06-24","arxiv_id":"2007.04921","repositories_listed":2,"syntology":{"n":8,"n_ran":0,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/graph-partitioning-based-diffusion","title":"Graph-Partitioning-Based Diffusion Convolutional Recurrent Neural Network for Large-Scale Traffic Forecasting","date":"2019-09-24","arxiv_id":"1909.11197","repositories_listed":2,"syntology":null},{"url":"/paper/ego-splitting-framework-from-non-overlapping","title":"Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters","date":"2017-08-13","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/demystifying-distributed-training-of-graph","title":"Demystifying Distributed Training of Graph Neural Networks for Link Prediction","date":"2025-06-25","arxiv_id":"2506.20818","repositories_listed":1,"syntology":null},{"url":"/paper/distmlip-a-distributed-inference-platform-for","title":"DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials","date":"2025-05-28","arxiv_id":"2506.02023","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/hierarchical-superpixel-segmentation-via","title":"Hierarchical Superpixel Segmentation via Structural Information Theory","date":"2025-01-13","arxiv_id":"2501.07069","repositories_listed":1,"syntology":null},{"url":"/paper/fairgp-a-scalable-and-fair-graph-transformer","title":"FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning","date":"2024-12-14","arxiv_id":"2412.10669","repositories_listed":1,"syntology":null},{"url":"/paper/towards-the-efficacy-of-federated-prediction","title":"Towards the efficacy of federated prediction for epidemics on networks","date":"2024-12-03","arxiv_id":"2412.02161","repositories_listed":1,"syntology":null},{"url":"/paper/upsampling-dinov2-features-for-unsupervised","title":"Upsampling DINOv2 features for unsupervised vision tasks and weakly supervised materials segmentation","date":"2024-10-20","arxiv_id":"2410.19836","repositories_listed":1,"syntology":null},{"url":"/paper/towards-faster-graph-partitioning-via-pre","title":"Towards Faster Graph Partitioning via Pre-training and Inductive Inference","date":"2024-09-01","arxiv_id":"2409.00670","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-surgical-instrument-segmentation","title":"Revisiting Surgical Instrument Segmentation Without Human Intervention: A Graph Partitioning View","date":"2024-08-27","arxiv_id":"2408.14789","repositories_listed":1,"syntology":null},{"url":"/paper/causal-discovery-over-high-dimensional","title":"Causal Discovery over High-Dimensional Structured Hypothesis Spaces with Causal Graph Partitioning","date":"2024-06-10","arxiv_id":"2406.06348","repositories_listed":1,"syntology":null},{"url":"/paper/a-random-key-grasp-for-combinatorial","title":"A random-key GRASP for combinatorial optimization","date":"2024-05-29","arxiv_id":"2405.18681","repositories_listed":1,"syntology":null},{"url":"/paper/a-structure-aware-framework-for-learning","title":"A Structure-Aware Framework for Learning Device Placements on Computation Graphs","date":"2024-05-23","arxiv_id":"2405.14185","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-key-point-analysis-with-pairwise","title":"Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning","date":"2024-04-17","arxiv_id":"2404.11384","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_unverified":5,"n_pointer_only":13}},{"url":"/paper/unleashing-graph-partitioning-for-large-scale","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","date":"2024-03-04","arxiv_id":"2403.01797","repositories_listed":1,"syntology":null},{"url":"/paper/towards-cohesion-fairness-harmony-contrastive","title":"Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering","date":"2024-02-16","arxiv_id":"2402.10756","repositories_listed":1,"syntology":null},{"url":"/paper/bclean-a-bayesian-data-cleaning-system","title":"BClean: A Bayesian Data Cleaning System","date":"2023-11-11","arxiv_id":"2311.06517","repositories_listed":1,"syntology":null},{"url":"/paper/neurocut-a-neural-approach-for-robust-graph","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","date":"2023-10-18","arxiv_id":"2310.11787","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-few-shot-learning-for-1","title":"Self-supervised Few-shot Learning for Semantic Segmentation: An Annotation-free Approach","date":"2023-07-26","arxiv_id":"2307.14446","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-normalized-cut-graph-partitioning","title":"Spectral Normalized-Cut Graph Partitioning with Fairness Constraints","date":"2023-07-22","arxiv_id":"2307.12065","repositories_listed":1,"syntology":null},{"url":"/paper/graph-ladling-shockingly-simple-parallel-gnn","title":"Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication","date":"2023-06-18","arxiv_id":"2306.10466","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/creating-multi-level-skill-hierarchies-in","title":"Creating Multi-Level Skill Hierarchies in Reinforcement Learning","date":"2023-06-16","arxiv_id":"2306.09980","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-graph-unlearning","title":"Inductive Graph Unlearning","date":"2023-04-06","arxiv_id":"2304.03093","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-graph-embedding-with-information","title":"Distributed Graph Embedding with Information-Oriented Random Walks","date":"2023-03-28","arxiv_id":"2303.15702","repositories_listed":1,"syntology":null},{"url":"/paper/random-projection-tree-similarity-metric-for","title":"Random projection tree similarity metric for SpectralNet","date":"2023-02-25","arxiv_id":"2302.13168","repositories_listed":1,"syntology":null}],"syntology_records":5,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}