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
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 353 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00026277992 |
| 574 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB | 0.00019883211 |
| 1,305 | Bayesian Locality Sensitive Hashing for Fast Similarity Search | 2012 | VLDB | 0.00012687101 |
| 4,020 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 6.5237459e-05 |
| 7,757 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB | 4.6598957e-05 |
| 7,849 | Demystifying Graph Sparsification Algorithms in Graph Properties Preservation | 2024 | VLDB | 4.6362484e-05 |
| 7,904 | Coarsening Massive Influence Networks for Scalable Diffusion Analysis | 2017 | SIGMOD | 4.6214923e-05 |
| 8,902 | DoppelGanger++: Towards Fast Dependency Graph Generation for Database Replay | 2024 | SIGMOD | 4.427232e-05 |
| 11,138 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB | 4.1945683e-05 |
| 11,355 | SparRL: Graph Sparsification via Deep Reinforcement Learning | 2022 | SIGMOD | 4.1945683e-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 |
|---|---|---|---|---|
| 57 | Discovering Large Dense Subgraphs in Massive Graphs | 2005 | VLDB | 0.00065491112 |
| 2,183 | Keyword Search on External Memory Data Graphs | 2008 | VLDB | 9.3439219e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,552 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD | 4.3254416e-05 |
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00028097557 |
| 1,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |
| 4,485 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.1458149e-05 |
| 353 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00026277992 |
| 13,251 | Scalable Community Detection via Parallel Correlation Clustering | 2021 | VLDB | - |
| 7,849 | Demystifying Graph Sparsification Algorithms in Graph Properties Preservation | 2024 | VLDB | 4.6362484e-05 |
| 2,542 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB | 8.5794502e-05 |
| 3,597 | Parallel Local Graph Clustering | 2016 | VLDB | 6.9345175e-05 |
| 11,138 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB | 4.1945683e-05 |