Demystifying Graph Sparsification Algorithms in Graph Properties Preservation
Summary: Empirical benchmarking of 12 sparsifiers across 16 graph metrics on 14 real-world graphs with an open-source evaluation framework. No universal sparsifier—clear tradeoffs (e.g., distance-preserving methods degrade GNN performance); provides artifacts and guidance to match sparsifiers to downstream tasks. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuhan Chen
- 2. Haojie Ye
- 3. Sanketh Vedula
- 4. Alex Bronstein
- 5. Ronald Dreslinski
- 6. Trevor Mudge
- 7. Nishil Talati
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,827 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.3113542e-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 |
|---|---|---|---|---|
| 777 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD | 0.0001679862 |
Previous
Page 1 / 1
Next