Budgeted Strong Community Search in Heterogeneous Graphs
Summary: StrCom: use meta-path counts to quantify relationship strength; defines Budgeted Strong Community (BSC) with a size budget and shows BSC is NP-hard and not in APX. Proposes Shrink/Expand/Hybrid algorithms with optimizations; reports 3.5–107× PathSim and 2–5 orders gains over baselines. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wentong Zhang (Beijing Institute of Technology)
- 2. Kaiyu Feng (Beijing Institute of Technology)
- 3. Lanting Fang (Beijing Institute of Technology)
- 4. Junghoon Kim (Ulsan National Institute of Science and Technology)
- 5. Kaibo Zhang (Beijing Institute of Technology)
- 6. Dahee Kim (Ulsan National Institute of Science and Technology)
- 7. Shuliang Wang (Beijing Institute of Technology)
- 8. Ye Yuan (Beijing Institute of Technology)
- 9. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{zhang_sigmod26,
title = {{Budgeted Strong Community Search in Heterogeneous Graphs}},
author = {Zhang, Wentong and Feng, Kaiyu and Fang, Lanting and Kim, Junghoon and Zhang, Kaibo and Kim, Dahee and Wang, Shuliang and Yuan, Ye and Wang, Guoren},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769768},
url = {https://dl.acm.org/doi/10.1145/3769768},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,413 | To Learn or Not to Learn? An In-depth Empirical Analysis of Community Search Approaches | 2027 | SIGMOD | 4.9605343e-05 |
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.
Previous
Page 1 / 1
Next