Dynamic Structural Clustering on Graphs
Summary: Dynamic StrClu (DynELM) maintains Jaccard clustering on graphs under edge updates; polylog updates, linear space, and a delta*-guaranteed quality sandwich. DynStrClu adds cluster-group-by; experiments on 15 real datasets show up to 1,000× speedups with preserved quality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Boyu Ruan
- 2. Junhao Gan
- 3. Hao Wu
- 4. Anthony Wirth
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,989 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8716197e-05 |
| 7,451 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7263711e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-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,882 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1945683e-05 |
| 11,259 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1945683e-05 |
| 11,361 | Approximate Range Thresholding | 2022 | SIGMOD | 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 |
|---|---|---|---|---|
| 1,640 | Communication-Efficient Distributed Monitoring of Thresholded Counts | 2006 | SIGMOD | 0.0001104808 |
| 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 |
| 3,264 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.3094408e-05 |
| 5,894 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 5.2864259e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,777 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.00010589591 |
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 11,259 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1945683e-05 |
| 3,264 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.3094408e-05 |
| 6,725 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB | 4.9484066e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 2,436 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8252104e-05 |
| 6,989 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8716197e-05 |