Results 231 to 240 of about 175,302 (247)

Efficient Maximum Closeness Centrality Group Identification

Lecture Notes in Computer Science, 2016
As a key concept in the social networks, closeness centrality is widely adopted to measure the importance of a node. Many efficient algorithms are developed in the literature to find the top-k closeness centrality nodes.
Xiaoyang Wang
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Closeness centrality via the Condorcet principle

Social Networks, 2023
Oskar Skibski
exaly  

Closeness Centrality on Uncertain Graphs

ACM Transactions on the Web, 2023
Zhaonian Zou
exaly  

Maintaining the duality of closeness and betweenness centrality

Social Networks, 2016
Ulrik Brandes, Stephen Borgatti, Linton Freeman   +2 more
exaly  

A novel approach of closeness centrality measure for voltage stability analysis in an electric power grid

International Journal of Emerging Electric Power Systems, 2020
Yanxia Sun, Isaiah ADEBAYO
exaly  

People also looked at

Frontiers in Psychology, 2017
Michael S. Vitevitch, Rutherford Goldstein   +1 more
exaly  

DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks

Computer Networks, 2013
Artur Ziviani, Klaus Wehmuth
exaly  

Finding Critical Links for Closeness Centrality

INFORMS Journal on Computing, 2019
Eduardo Pasiliao, Alexander Veremyev, Oleg A. Prokopyev   +2 more
exaly  

Computing top-k Closeness Centrality Faster in Unweighted Graphs

ACM Transactions on Knowledge Discovery From Data, 2019
Pierluigi Crescenzi, Henning Meyerhenke, Andrea Marino   +2 more
exaly  

A New Closeness Centrality Measure based on Minimum Weight Spanning Tree

2023
Reggie Davidrajuh
exaly