Overview

Graph sparsification studies how to remove edges while keeping important properties such as connectivity, Laplacian spectra, signal propagation, or downstream task performance. Methods include effective-resistance sampling and other spectral techniques, spanning-tree and nearest-neighbor constructions, and learned or task-aware edge selection. Researchers evaluate sparse graphs in settings such as GNN node classification, semi-supervised learning, routing, and traveling-salesperson optimization, measuring both accuracy or solution quality and savings in memory or computation. A central tension is that preserving global structure does not always preserve task-specific behavior: sparsity, propagation fidelity, and downstream performance can trade off, especially across different graph types and tasks.

Latest papers

CardsList

24 papers4 papers in the last four weeks, down 20% on the four weeks before. 0.0% of all new papers.

  1. Feature-Aware Edge Sampling for Approximate One-Step Laplacian Propagation

    Nov 12, 2026Jonathan Z. Sun, Zheng Wang, Kebin XuApproximate Message PassingGraph Neural Networks

  2. Degree-Equalized View-Graph Selection under Tight Pair Budgets

    Nov 5, 2026Minhyeok Im, Jongseong Brad ChoiGraph SparsificationMulti-View Geometry

  3. GNN-Guided Network Reduction for Centralized Urban Traffic Routing

    Oct 27, 2026Nikolai Antonov, Lukáš Chrpa, Andrii Nyporko +1Vehicle RoutingIntelligent Transportation Systems

  4. Decoupled Prune-and-Reconstruct: Training on a Compact Core with Double-Layer Sparsification

    Oct 25, 2026Siqi Gu, Gaozhen Ma, Liheng Huang +4Graph Neural NetworksMemory-Efficient Training

  5. EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks

    Oct 6, 2026Sai Karthik Navuluru, Siddhartha Shankar Das, Franck Dernoncourt +7Graph SparsificationGraph Neural Networks

  6. Co-Optimizing Graph Sparsification and Approximate Computing for Energy-Efficient FPGA-Based GCN Inference

    Oct 5, 2026Nathaniel Kaye Mellor, Shreejith Shanker, George FlorosEdge ComputingGraph Sparsification

  7. Inspection-SPARS: Task-Oriented Sparse Roadmaps for Inspection Planning

    Sep 28, 2026Adir Morgan, Oren Salzman, Kiril SoloveyRobotic InspectionRoadmap-Based Motion Planning

  8. Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks

    Sep 25, 2026Siddhartha Shankar Das, Sai Karthik Navuluru, S M Ferdous +7Graph SparsificationGraph Neural Networks

  9. Scaffold-Constrained Subset Dynamic Programming for Exact SSE Clustering

    Sep 24, 2026Yordan P. Raykov, Max A. LittleClusteringDynamic Programming

  10. CAST: Canonical Approximate Schur Tree for Approximate Cholesky on Graphs

    Sep 8, 2026Meher Chaitanya, Cameron Musco, Aristides GionisGraph SparsificationMatrix Factorization

  11. Does Graph Compression Preserve Signal Propagation?

    Jul 25, 2026Kawshik Banerjee, Khaled Mohammed SaifuddinGraph Signal ProcessingGraph Coarsening

  12. GES-TSP: Graph Edge Sparsification for TSP

    Jun 23, 2026Tianfeng Chen, Xianyue LiTraveling Salesperson ProblemGraph Structure Learning

  13. Graph Reduction in Multirelational Networks: A Spreading-Oriented Reduction Benchmark

    Jun 10, 2026Mateusz Stolarski, Michał Czuba, Piotr Bielak +1Graph CoarseningGraph Sparsification

  14. Informative Graph Structure Learning

    May 16, 2026Shen Han, Zhiyao Zhou, Jiawei Chen +6Graph Structure LearningGraph Sparsification

  15. Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks

    May 1, 2026Sanjukta KrishnagopalGraph Neural NetworksNeural Representation Geometry

  16. Large-scale semi-supervised learning with online spectral graph sparsification

    Apr 29, 2026Daniele Calandriello, Alessandro Lazaric, Michal ValkoGraph SparsificationGraph-Based Semi-Supervised Learning

  17. Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem

    Apr 22, 2026Bo-Cheng Lin, Yi Mei, Mengjie ZhangTraveling Salesperson ProblemGraph Sparsification

  18. Improved large-scale graph learning through ridge spectral sparsification

    Apr 22, 2026Daniele Calandriello, Ioannis Koutis, Alessandro Lazaric +1Graph SparsificationSpectral Methods

  19. Learning-Guided Sparsification of Dynamic Graphs in Robotic Exploration

    Apr 15, 2026Adithya V. Sastry, Bibek Poudel, Weizi LiGraph SparsificationMobile Robotics

  20. Multi-Agent Training-free Urban Food Delivery System using Resilient UMST Network

    Mar 24, 2026Md Nahid Hasan, Vishwam Tiwari, Aditya Challa +2Vehicle RoutingIntelligent Transportation Systems

  21. a-TMFG: Scalable Triangulated Maximally Filtered Graphs via Approximate Nearest Neighbors

    Mar 10, 2026Lionel YelibiGraph ConstructionGraph Sparsification

  22. Not All Neighbors Matter: Understanding the Impact of Graph Sparsification on GNN Pipelines

    Mar 7, 2026Yuhang Song, Naima Abrar Shami, Romaric Duvignau +1Graph SparsificationGraph Neural Networks

  23. Global-Aware Edge Prioritization for Pose Graph Initialization

    Feb 25, 2026Tong Wei, Giorgos Tolias, Jiri Matas +1Structure from MotionGraph Sparsification