Demystifying Graph Sparsification Algorithms in Graph Properties Preservation
Summary: Systematically benchmarks 12 sparsifiers across 16 graph metrics and 14 real-world graphs. Reveals strong property-dependent tradeoffs—no universal sparsifier preserves both structural distances and downstream GNN behavior—and releases an extensible evaluation framework. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuhan Chen (University of Michigan)
- 2. Haojie Ye (University of Michigan)
- 3. Sanketh Vedula (Technion)
- 4. Alex Bronstein (Technion)
- 5. Ronald Dreslinski (University of Michigan)
- 6. Trevor Mudge (University of Michigan)
- 7. Nishil Talati (University of Michigan)
BibTeX Citation
@article{chen_vldb24,
title = {{Demystifying Graph Sparsification Algorithms in Graph Properties Preservation}},
author = {Chen, Yuhan and Ye, Haojie and Vedula, Sanketh and Bronstein, Alex and Dreslinski, Ronald and Mudge, Trevor and Talati, Nishil},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {3},
pages = {427--440},
doi = {10.14778/3632093.3632106},
url = {https://doi.org/10.14778/3632093.3632106},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,960 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 6.0274692e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.00011865557 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,972 | GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing | 2025 | VLDB |
| 2 | 11,757 | Factorized Graph Representations for Semi-Supervised Learning from Sparse Data | 2020 | SIGMOD |
| 3 | 10,862 | GraphSparseNet: a Novel Method for Large Scale Traffic Flow Prediction | 2025 | VLDB |
| 4 | 1,146 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 5 | 10,913 | Inference-friendly Graph Compression for Graph Neural Networks | 2025 | VLDB |
| 6 | 10,309 | A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness | 2026 | SIGMOD |
| 7 | 9,190 | Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach | 2024 | VLDB |
| 8 | 11,553 | SparRL: Graph Sparsification via Deep Reinforcement Learning | 2022 | SIGMOD |
| 9 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 10 | 11,344 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB |