Current Flow Group Closeness Centrality for Complex Networks

11 Feb 2018 Li Huan Peng Richard Shan Liren Yi Yuhao Zhang Zhongzhi

Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the problem of finding a subset $S$ of $k$ vertices to maximize its CFCC $C(S)$, both theoretically and experimentally... (read more)

PDF Abstract

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • SOCIAL AND INFORMATION NETWORKS