作者: Xiaohui Bei , Wei Chen , Shang-Hua Teng , Jialin Zhang , Jiajie Zhu
DOI: 10.1016/J.TCS.2011.09.028
关键词: Node (networking) 、 Bounded function 、 Nash equilibrium 、 Betweenness centrality 、 Theoretical computer science 、 Shortest path problem 、 Algorithmic game theory 、 Computer science 、 Social network
摘要: In computer networks and social networks, the betweenness centrality of a node measures amount information passing through when all pairs are conducting shortest path exchanges. ...