Author:
De Meo Pasquale,Ferrara Emilio,Fiumara Giacomo,Provetti Alessandro
Subject
Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software
Reference50 articles.
1. T. Alahakoon, R. Tripathi, N. Kourtellis, R. Simha, A. Iamnitchi. K-path centrality: a new centrality measure in social networks, in: Proceedings of 4th Workshop on Social Network Systems, 2011, pp. 1–6.
2. Tolerating the community detection resolution limit with edge weighting;Berry;Physical Review E,2011
3. Fast unfolding of communities in large networks;Blondel;Journal of Statistical Mechanics: Theory and Experiment,2008
4. A faster algorithm for betweenness centrality;Brandes;Journal of Mathematical Sociology,2011
5. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski, D. Wagner, On finding graph clusterings with maximum modularity, in: Graph-Theoretic Concepts in Computer Science, 2007, pp. 121–132.
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献