Back to papers
Efficient Structural Graph Clustering: An Index-Based Approach
Summary: Index-based SCAN for structural graph clustering, delivering clusters, hubs, and outliers without full-graph scans. Time O(sum_C |E_C|) proportional to the result size, space O(m), supports dynamic updates, with strong gains on real networks up to >1B edges.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11740
- Venue
- VLDB
- Year
- 2018
- Pagerank
- 8.8166939e-05
- Overall Rank
- 2,440 | 83.05%
- DOI
-
10.14778/3157794.3157795
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,488 |
Parallel Index-Based Structural Graph Clustering and Its Approximation |
2021 |
SIGMOD |
6.139905e-05 |
| 4,654 |
Dynamic Structural Clustering on Graphs |
2021 |
SIGMOD |
6.0129362e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
4.9972607e-05 |
| 6,987 |
Effective Indexing for Dynamic Structural Graph Clustering |
2022 |
VLDB |
4.8669464e-05 |
| 7,581 |
Querying Structural Diversity in Streaming Graphs |
2024 |
VLDB |
4.701915e-05 |
| 7,874 |
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms |
2021 |
VLDB |
4.6263724e-05 |
| 9,246 |
Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs |
2024 |
VLDB |
4.3648789e-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,280 |
FB*: A Compact Index for Efficient and Exact Density-based Clustering |
2026 |
VLDB |
4.1905499e-05 |
| 10,562 |
Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks |
2025 |
VLDB |
4.1905499e-05 |
| 10,883 |
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering |
2025 |
VLDB |
4.1905499e-05 |
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.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,206 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1522897e-05 |
| 9,552 |
Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs |
2025 |
SIGMOD |
4.3212967e-05 |
| 10,159 |
Efficient Influential Community Search over Dynamic Graphs |
2026 |
SIGMOD |
4.1905499e-05 |
| 2,541 |
Scalable Discovery of Best Clusters on Large Graphs |
2010 |
VLDB |
8.5710863e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 2,718 |
SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs |
2015 |
VLDB |
8.2356874e-05 |
| 4,654 |
Dynamic Structural Clustering on Graphs |
2021 |
SIGMOD |
6.0129362e-05 |
| 9,379 |
An Efficient Algorithm for Distance-based Structural Graph Clustering |
2023 |
SIGMOD |
4.3439594e-05 |
| 4,488 |
Parallel Index-Based Structural Graph Clustering and Its Approximation |
2021 |
SIGMOD |
6.139905e-05 |
| 6,987 |
Effective Indexing for Dynamic Structural Graph Clustering |
2022 |
VLDB |
4.8669464e-05 |