A biased edge enhancement method for truss-based community search

Graphical abstract

References

[1] Akbas E, Zhao P . Truss-based community search: a truss-equivalence based indexing approach. Proceedings of the VLDB Endowment, 2017, 10( 11): 1298–1309

[2] Huang X, Cheng H, Qin L, Tian W, Yu J X. Querying k-truss community in large and dynamic graphs. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data. 2014, 1311–1322

[3] Fang Y, Wang Z, Cheng R, Wang H, Hu J . Effective and efficient community search over large directed graphs. IEEE Transactions on Knowledge and Data Engineering, 2019, 31( 11): 2093–2107

[4] Cui W, Xiao Y, Wang H, Wang W. Local search of communities in large graphs. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data. 2014, 991–1002

[5] Luo W, Zhang D, Jiang H, Ni L, Hu Y . Local community detection with the dynamic membership function. IEEE Transactions on Fuzzy Systems, 2018, 26( 5): 3136–3150

[6] Luo W, Lu N, Ni L, Zhu W, Ding W . Local community detection by the nearest nodes with greater centrality. Information Sciences, 2020, 517: 377–392

[7] Xu T, Lu Z, Zhu Y . Efficient triangle-connected truss community search in dynamic graphs. Proceedings of the VLDB Endowment, 2022, 16( 3): 519–531

Acknowledgements

This work was supported by the Research Foundation of Education Bureau of Hunan Province of China (Grant Nos. 20B625, 22B0275), and the Changsha Natural Science Foundation (Grant No. kq2202294).

Competing interests

The authors declare that they have no competing interests or financial conflicts to disclose.

Electronic supplementary material

Supplementary material is available in the online version of this article at journal. hep.com.cn and link.springer.com

RIGHTS & PERMISSIONS

2024 Higher Education Press