Database Paper Browser

Back to papers

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)

Paper ID
13634
Venue
VLDB
Year
2024
Pagerank
4.6362484e-05
Overall Rank
7,849 | 45.40%
DOI
10.14778/3632093.3632106

Incoming Non-self Citations Over Time

Authors

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

Semantically Similar Papers