Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications,Modelling and Simulation,Information Systems
Reference42 articles.
1. AlGhamdi, Z., Jamour, F., Skiadopoulos, S., Kalnis, P.: A benchmark for betweenness centrality approximation algorithms on large graphs. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management (SSDBM), p. 6 (2017)
2. Ang, C.S.: Interaction networks and patterns of guild community in massively multiplayer online games. Soc. Netw. Anal. Min. 1, 341 (2011)
3. Anthonisse, J.: The rush in a directed graph. Technical Report, Stichting Mathematisch Centrum (1971)
4. Bergamini, E., Meyerhenke, H.: Fully-dynamic approximation of betweenness centrality. In: Algorithms-ESA 2015, pp. 155–166. Springer, Berlin (2015)
5. Bergamini, E., Meyerhenke, H., Ortmann, M., Slobbe, A.: Faster betweenness centrality updates in evolving networks. In: 16th International Symposium on Experimental Algorithms, SEA 2017, June 21–23, 2017, pp. 23:1–23:16, London (2017)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献