Author:
Hoppe H. Ulrich,Harrer Andreas,Göhnert Tilman,Hecking Tobias
Publisher
Springer International Publishing
Reference41 articles.
1. Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006). Group formation in large social networks: Membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 44–54), Philadelphia, PA. doi:
10.1145/1150402.1150412
.
2. Batagelj, V. (2003). Efficient algorithms for citation network analysis. In arXiv preprint cs/0309023. Retrieved from
http://arxiv.org/abs/cs/0309023
.
3. Batagelj, V., & Zaveršnik, M. (2003). An o(m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049. Retrieved from
http://arxiv.org/abs/cs/0310049
.
4. Borgatti, S. P., Mehra, A., Brass, D. J., & Labianca, G. (2009). Network analysis in the social sciences. Science, 323, 892–895.
5. Bròdka, P., Saganowski, S., & Kazienko, P. (2013). GED: The method for group evolution discovery in social networks. Social Network Analysis and Mining, 3, 1–14.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献