SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs
Summary: SCAN++ introduces a DTAR (directly two-hop-away reachable node) data structure to accelerate clustering, hubs, and outlier detection on large-scale graphs. By limiting density computations to DTAR-relevant two-hop neighbors and sharing evaluations, it preserves SCAN’s results while delivering substantial runtime gains on real and synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 4,485 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.1458149e-05 |
| 4,657 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.0187213e-05 |
| 6,989 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8716197e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 11,787 | Scaling Locally Linear Embedding | 2017 | SIGMOD | 4.1945683e-05 |
| 13,337 | Fast Algorithm for the Lasso based L1-Graph Construction | 2017 | VLDB | - |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 110 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00047892924 |
| 11,955 | Scaling Manifold Ranking Based Image Retrieval | 2015 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next