DBScholar

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
hcbf3db98e8c1c328
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,576 | 28.92%
DOI
10.1145/3769789

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{liu_sigmod26,
        title = {{Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements}},
        author = {Liu, Yang and Huang, Hejiao and Yu, Kaiqiang and Liu, Shengxin and Long, Cheng and Gu, Zhaoquan},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769789},
        url = {https://dl.acm.org/doi/10.1145/3769789},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

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
184 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026097449
285 Local Search of Communities in Large Graphs 2014 SIGMOD 0.00022140086
1,130 Approximate Closest Community Search in Networks 2016 VLDB 0.00011897973
1,354 Truss-based Community Search over Large Directed Graphs 2020 SIGMOD 0.00010922947
1,664 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.9394611e-05
3,329 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD 7.4158814e-05
3,444 Efficient Size-Bounded Community Search over Large Networks 2021 VLDB 7.2931726e-05
4,780 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 6.4161407e-05
5,268 An Optimal and Progressive Approach to Online Search of Top-K Influential Communities 2018 VLDB 6.2008992e-05
5,554 Theoretically and Practically Efficient Maximum Defective Clique Search 2024 SIGMOD 6.0831622e-05
5,664 Efficiently Computing k-Edge Connected Components via Graph Decomposition 2013 SIGMOD 6.0444315e-05
6,468 Efficient Progressive Minimum k-Core Search 2020 VLDB 5.7724639e-05
7,815 Feedback-Aware Social Event-Participant Arrangement 2017 SIGMOD 5.4467489e-05
8,651 Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs 2025 SIGMOD 5.2929907e-05
8,973 An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery 2024 SIGMOD 5.2462145e-05
9,684 Efficient Maximum s-Bundle Search via Local Vertex Connectivity 2025 SIGMOD 5.1411629e-05
9,871 Deep Overlapping Community Search via Subspace Embedding 2025 SIGMOD 5.115241e-05
Previous Page 1 / 1 Next

Semantically Similar Papers