Back to papers
Efficient Size-Bounded Community Search over Large Networks
Summary: Exact SC-BRB for size-bounded community search: find a connected subgraph containing q with l <= |V| <= h, maximizing min-degree. NP-hard; uses reductions, upper bounds, and branching to beat GreedyF and baselines, with speedups on large graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12333
- Venue
- VLDB
- Year
- 2021
- Pagerank
- 6.5787567e-05
- Overall Rank
- 3,969 | 72.39%
- DOI
-
10.14778/3457390.3457407
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 4,843 |
Butterfly-Core Community Search over Labeled Graphs |
2021 |
VLDB |
5.8823824e-05 |
| 5,610 |
Influential Community Search over Large Heterogeneous Information Networks |
2023 |
VLDB |
5.4118541e-05 |
| 5,950 |
DMCS : Density Modularity based Community Search |
2022 |
SIGMOD |
5.2592833e-05 |
| 7,341 |
Scalable Time-Range k-Core Query on Temporal Graphs |
2023 |
VLDB |
4.7576413e-05 |
| 7,409 |
CommunityAF: An Example-based Community Search Method via Autoregressive Flow |
2023 |
VLDB |
4.7370979e-05 |
| 8,630 |
A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition |
2022 |
VLDB |
4.480887e-05 |
| 10,057 |
Budgeted Strong Community Search in Heterogeneous Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,076 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,181 |
LMSC: Local Sketch Modularity Optimisation for Size-Constrained Community Search in Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,582 |
A Flexible Framework for Query-oriented Interactive Community Search |
2025 |
VLDB |
4.1945683e-05 |
| 10,648 |
A Comprehensive Survey and Experimental Study of Learning-based Community Search |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 353 |
Local Search of Communities in Large Graphs |
2014 |
SIGMOD |
0.00026277992 |
| 1,550 |
Approximate Closest Community Search in Networks |
2016 |
VLDB |
0.00011423628 |
| 1,637 |
Truss-based Community Search over Large Directed Graphs |
2020 |
SIGMOD |
0.0001105259 |
| 1,645 |
Attribute-Driven Community Search |
2017 |
VLDB |
0.00011037459 |
| 2,286 |
Effective and Efficient Community Search over Large Heterogeneous Information Networks |
2020 |
VLDB |
9.0982591e-05 |
| 2,603 |
Maximum Co-located Community Search in Large Scale Social Networks |
2018 |
VLDB |
8.4666465e-05 |
| 3,854 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6988744e-05 |
| 5,643 |
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities |
2018 |
VLDB |
5.3928286e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,499 |
The Flexible Socio Spatial Group Queries |
2019 |
VLDB |
5.0382007e-05 |
| 6,588 |
Efficient Progressive Minimum k-Core Search |
2020 |
VLDB |
5.0020648e-05 |
| 7,644 |
Feedback-Aware Social Event-Participant Arrangement |
2017 |
SIGMOD |
4.6898827e-05 |
Semantically Similar Papers