Author:
Xu Jian,Fu Xiaoyi,Tu Liming,Luo Ming,Xu Ming,Zheng Ning
Publisher
Springer International Publishing
Reference20 articles.
1. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
2. Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: Proceedings of the ACM SIGMOD, pp. 277–288 (2013)
3. Danon, L., Dazguilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09) (2005)
4. Eppstein, D., Maarten, L., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. Comput. Sci. 6506, 403–414 (2010)
5. Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12(3), 211–223 (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toponym Based Community Search in Large Social Network;2021 2nd International Conference on Computer Engineering and Intelligent Control (ICCEIC);2021-11
2. Community Search over Big Graphs;Synthesis Lectures on Data Management;2019-08-06