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,987 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8669464e-05 |
| 7,450 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 4.7218383e-05 |
| 9,379 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3439594e-05 |
| 10,159 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 4.1905499e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1905499e-05 |
| 10,886 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 4.1905499e-05 |
| 11,261 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1905499e-05 |
| 11,363 | Approximate Range Thresholding | 2022 | SIGMOD | 4.1905499e-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,642 | Communication-Efficient Distributed Monitoring of Thresholded Counts | 2006 | SIGMOD | 0.00011037826 |
| 2,440 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8166939e-05 |
| 2,718 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB | 8.2356874e-05 |
| 3,078 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.6041723e-05 |
| 5,827 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 5.3111132e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,776 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 0.0001058029 |
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 3,323 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.2170169e-05 |
| 11,261 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 4.1905499e-05 |
| 3,078 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.6041723e-05 |
| 6,729 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB | 4.943658e-05 |
| 10,988 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1905499e-05 |
| 9,379 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3439594e-05 |
| 2,440 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.8166939e-05 |
| 6,987 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 4.8669464e-05 |