Publisher
Springer International Publishing
Reference19 articles.
1. Akgün, M.K., Tural, M.K.: k-step betweenness centrality. Comput. Math. Organ. Theory 26(1), 55–87 (2019). https://doi.org/10.1007/s10588-019-09301-9
2. Barthelemy, M.: Betweenness Centrality, pp. 51–73. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-20565-6_4
3. Caporossi, G., Paiva, M., Vukicevic, D., Segatto, M.: Centrality and betweenness: vertex and edge decomposition of the Wiener index. MATCH - Commun. Math. Comput. Chem. 68 (2012)
4. Chehreghani, M.H.: An efficient algorithm for approximate betweenness centrality computation. Comput. J. 57(9), 1371–1382 (2014). https://doi.org/10.1093/comjnl/bxu003
5. Comellas, F., Gago, S.: Spectral bounds for the betweenness of a graph. Linear Algebra Appl. 423(1), 74–80 (2007). https://doi.org/10.1016/j.laa.2006.08.027. Special Issue devoted to papers presented at the Aveiro Workshop on Graph Spectra
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献