Finding k-highest betweenness centrality vertices in graphs
暂无分享,去创建一个
The betweenness centrality is a measure for the relative participation of the vertex in the shortest paths in the graph. In many cases, we are interested in the k-highest betweenness centrality vertices only rather than all the vertices in a graph. In this paper, we study an efficient algorithm for finding the exact k-highest betweenness centrality vertices.
[1] J. Anthonisse. The rush in a directed graph , 1971 .
[2] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[3] Ryan H. Choi,et al. QUBE: a quick algorithm for updating betweenness centrality , 2012, WWW.