DBScholar

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
12521
Venue
VLDB
Year
2021
Pagerank
7.44939e-05
Overall Rank
3,395 | 76.71%
DOI
10.14778/3457390.3457407

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yao_vldb21,
        title = {{Efficient Size-Bounded Community Search over Large Networks}},
        author = {Yao, Kai and Chang, Lijun},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {8},
        pages = {1441--1453},
        doi = {10.14778/3457390.3457407},
        url = {https://doi.org/10.14778/3457390.3457407},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers