Abstract
This paper considers the problem of finding the most central nodes in neighborhoods of a given network with directed or undirected links taking into account only local information.An algorithm that calculates ranking, taking into account the nhop neighborhood of each node is proposed. The method is compared to popular existing schemes for ranking, using Spearman's rank correlation coefficient and other metrics. An extension to a faster algorithm which reduces the size of the examined network is described as well. © 2009 IEEE.