Back to papers
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements
Summary: Revisits Size-bounded Community Search (connected subgraph containing query q, size in [l,h], maximize min-degree) and introduces a branch-and-bound that efficiently isolates structurally compact candidate subsets. Three frameworks plus a heuristic, two reduction rules and query decomposition yield ~100× speedups and denser communities on 12 large graphs vs prior exact methods.
(summarized by gpt-5-mini on Feb 11 2026)
- Paper ID
- 7386
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,076 | 29.98%
- DOI
-
10.1145/3769789
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 284 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029014359 |
| 354 |
Local Search of Communities in Large Graphs |
2014 |
SIGMOD |
0.00026253833 |
| 1,548 |
Approximate Closest Community Search in Networks |
2016 |
VLDB |
0.0001141271 |
| 1,641 |
Truss-based Community Search over Large Directed Graphs |
2020 |
SIGMOD |
0.00011044805 |
| 2,291 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0894835e-05 |
| 3,857 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6924202e-05 |
| 3,972 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
6.5724209e-05 |
| 5,620 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
5.4066581e-05 |
| 5,656 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3876479e-05 |
| 6,206 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1522897e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
4.9972607e-05 |
| 6,811 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9139947e-05 |
| 7,643 |
Feedback-Aware Social Event-Participant Arrangement |
2017 |
SIGMOD |
4.6853818e-05 |
| 9,396 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
4.3399748e-05 |
| 9,552 |
Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs |
2025 |
SIGMOD |
4.3212967e-05 |
| 9,553 |
Deep Overlapping Community Search via Subspace Embedding |
2025 |
SIGMOD |
4.3212967e-05 |
| 9,557 |
An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery |
2024 |
SIGMOD |
4.3212967e-05 |
Semantically Similar Papers