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: 7385
Venue: SIGMOD
Year: 2026
Pagerank: 4.1945683e-05
Overall Rank: 10,076 | 29.91%
DOI: 10.1145/3769789

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
283	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00029041257
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
2,286	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	9.0982591e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
3,969	Efficient Size-Bounded Community Search over Large Networks	2021	VLDB	6.5787567e-05
5,610	Influential Community Search over Large Heterogeneous Information Networks	2023	VLDB	5.4118541e-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,588	Efficient Progressive Minimum k-Core Search	2020	VLDB	5.0020648e-05
6,813	Theoretically and Practically Efficient Maximum Defective Clique Search	2024	SIGMOD	4.9187137e-05
7,644	Feedback-Aware Social Event-Participant Arrangement	2017	SIGMOD	4.6898827e-05
9,390	Efficient Maximum s-Bundle Search via Local Vertex Connectivity	2025	SIGMOD	4.3441378e-05
9,552	Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs	2025	SIGMOD	4.3254416e-05
9,553	Deep Overlapping Community Search via Subspace Embedding	2025	SIGMOD	4.3254416e-05
9,557	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3254416e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
999	Effective Community Search for Large Attributed Graphs	2016	VLDB	0.00014726563
353	Local Search of Communities in Large Graphs	2014	SIGMOD	0.00026277992
1,257	Influential Community Search in Large Networks	2015	VLDB	0.00013020648
10,159	Efficient Influential Community Search over Dynamic Graphs	2026	SIGMOD	4.1945683e-05
5,513	Effective Community Search over Large Star-Schema Heterogeneous Information Networks	2022	VLDB	5.4641695e-05
5,643	An Optimal and Progressive Approach to Online Search of Top-K Influential Communities	2018	VLDB	5.3928286e-05
7,290	Topic-based Community Search over Spatial-Social Networks	2020	VLDB	4.7742854e-05
10,694	Effective and Efficient Community Search for Complex Network Semantics Capture: From Coarse-Grain to Fine-Grain	2025	VLDB	4.1945683e-05
1,844	Effective Community Search over Large Spatial Graphs	2017	VLDB	0.00010341077
3,969	Efficient Size-Bounded Community Search over Large Networks	2021	VLDB	6.5787567e-05