Local Graph Sparsification for Scalable Clustering
Summary: Local graph sparsification by per-node edge pruning uses a minhash-based similarity to retain the top neighbors per node. The approach delivers 10-50x speedups with negligible quality loss, and even improves clustering accuracy for some algorithms. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Venu Satuluri (Ohio State University)
- 2. Srinivasan Parthasarathy (Ohio State University)
- 3. Yiye Ruan (Ohio State University)
BibTeX Citation
@inproceedings{satuluri_sigmod11,
title = {{Local Graph Sparsification for Scalable Clustering}},
author = {Satuluri, Venu and Parthasarathy, Srinivasan and Ruan, Yiye},
series = {{SIGMOD} '11},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1989323.1989399},
url = {https://dl.acm.org/doi/10.1145/1989323.1989399},
year = {2011}
}Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 285 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022150572 |
| 496 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB | 0.00017323054 |
| 992 | Bayesian Locality Sensitive Hashing for Fast Similarity Search | 2012 | VLDB | 0.00012646771 |
| 3,668 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.1131403e-05 |
| 7,894 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB | 5.4320165e-05 |
| 8,127 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD | 5.3940983e-05 |
| 8,358 | Demystifying Graph Sparsification Algorithms in Graph Properties Preservation | 2024 | VLDB | 5.3476128e-05 |
| 9,236 | DoppelGanger++: Towards Fast Dependency Graph Generation for Database Replay | 2024 | SIGMOD | 5.2056825e-05 |
| 11,662 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB | 4.9793485e-05 |
| 11,862 | SparRL: Graph Sparsification via Deep Reinforcement Learning | 2022 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 131 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00030242586 |
| 3,509 | Keyword Search on External Memory Data Graphs | 2008 | VLDB | 7.2474338e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,644 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD |
| 2 | 375 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB |
| 3 | 1,169 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 4 | 4,451 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD |
| 5 | 285 | Local Search of Communities in Large Graphs | 2014 | SIGMOD |
| 6 | 13,768 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB |
| 7 | 8,358 | Demystifying Graph Sparsification Algorithms in Graph Properties Preservation | 2024 | VLDB |
| 8 | 3,574 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 9 | 3,688 | Parallel Local Graph Clustering | 2016 | VLDB |
| 10 | 11,662 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB |