Closeness Centrality Group Identification (Closeness Centrality for a Set of Nodes)


Given a network G and a set S (S ⊆ V ) of nodes, the closeness centrality of S is denoted by c(S), which is measured by the inverse average distance from S to all the nodes in G.
Closeness Centrality Group Identification
where d(S, v) = min{d(u, v)} for u ∈ S.


  • Chen, C., Wang, W. and Wang, X., 2016, September. Efficient Maximum Closeness Centrality Group Identification. In Australasian Database Conference (pp. 43-55). Springer International Publishing. DOI: 10.1007/978-3-319-46922-5_4 Publisher web site Endnote RIS file


There are no comment yet.

Add your comment

Sum of    and