Effective Indexing for Dynamic Structural Graph Clustering
Summary: Effective index structures for dynamic SCAN on graphs under Jaccard similarity. Proposes bottom-k sketches per vertex and a bucketing update strategy to avoid fixed parameters, yielding provable approximate clustering with O(log n ยท (log M + m/p_f)) updates and large speedups over prior index-based methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Fangyuan Zhang
- 2. Sibo Wang
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 10,159 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1945683e-05 |
| 10,710 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 313 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00028097557 |
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 2,898 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB | 7.9445129e-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 |
Previous
Page 1 / 1
Next