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 (University of Queensland)
- 2. Junhao Gan (University of Melbourne)
- 3. Hao Wu (University of Melbourne)
- 4. Anthony Wirth (University of Melbourne)
BibTeX Citation
@inproceedings{ruan_sigmod21,
title = {{Dynamic Structural Clustering on Graphs}},
author = {Ruan, Boyu and Gan, Junhao and Wu, Hao and Wirth, Anthony},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452828},
url = {https://dl.acm.org/doi/10.1145/3448016.3452828},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB | 5.6920203e-05 |
| 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 5.6127752e-05 |
| 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 5.2675506e-05 |
| 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 5.093636e-05 |
| 11,105 | Towards Scalable and Practical Batch-Dynamic Connectivity | 2025 | VLDB | 5.093636e-05 |
| 11,458 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB | 5.093636e-05 |
| 11,559 | Approximate Range Thresholding | 2022 | SIGMOD | 5.093636e-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,433 | Communication-Efficient Distributed Monitoring of Thresholded Counts | 2006 | SIGMOD | 0.0001080304 |
| 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.5183361e-05 |
| 2,839 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB | 8.066541e-05 |
| 3,020 | Dynamic Density Based Clustering | 2017 | SIGMOD | 7.8445412e-05 |
| 5,867 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD | 6.0613257e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 2 | 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD |
| 3 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 4 | 11,458 | Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem | 2023 | VLDB |
| 5 | 3,020 | Dynamic Density Based Clustering | 2017 | SIGMOD |
| 6 | 5,977 | Maximal D-truss Search in Dynamic Directed Graphs | 2023 | VLDB |
| 7 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 8 | 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |
| 9 | 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 10 | 7,141 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |