Node-weighted centrality: a new way of centrality hybridization

A Singh, RR Singh, SRS Iyengar - Computational Social Networks, 2020 - Springer
Centrality measures have been proved to be a salient computational science tool for
analyzing networks in the last two to three decades aiding many problems in the domain of …

Centrality measures: a tool to identify key actors in social networks

RR Singh - Principles of Social Networking: The New Horizon and …, 2022 - Springer
Experts from several disciplines have been widely using centrality measures for analyzing
large as well as complex networks. These measures rank nodes/edges in networks by …

Adaptive Algorithms for Estimating Betweenness and k-path Centralities

M Haghir Chehreghani, A Bifet… - Proceedings of the 28th …, 2019 - dl.acm.org
Betweenness centrality and k-path centrality are two important indices that are widely used
to analyze social, technological and information networks. In the current paper, first given a …

Refining approximating betweenness centrality based on samplings

S Ji, Z Yan - arxiv preprint arxiv:1608.04472, 2016 - arxiv.org
Betweenness Centrality (BC) is an important measure used widely in complex network
analysis, such as social network, web page search, etc. Computing the exact BC values is …

An efficient heuristic for betweenness estimation and ordering

RR Singh, SRS Iyengar, S Chaudhary… - Social Network Analysis …, 2018 - Springer
Centrality measures, erstwhile popular amongst the sociologists and psychologists, have
seen broad and increasing applications across several disciplines of late. Amongst a …

Approximation and updation of betweenness centrality in dynamic complex networks

P Kumari, A Singh - … : Theories, Applications and Future Directions-Volume …, 2019 - Springer
A large network frequently evolves in nature; hence, it is necessary to update the
betweenness centrality efficiently. Previously, the complexity for updated betweenness …

A penalty box approach for approximation betweenness and closeness centrality algorithms

SS Khopkar, R Nagi, G Tauer - Social Network Analysis and Mining, 2016 - Springer
Centrality metrics are used to find important nodes in social networks. In the days of ever-
increasing social network sizes, it becomes more and more difficult to compute centrality …

Hybrid centrality measures for service coverage problem

A Singh, RR Singh, SRS Iyengar - … , CSoNet 2019, Ho Chi Minh City …, 2019 - Springer
Abstract Service Coverage Problem aims to find an ideal node for installing a service station
in a given network such that services requested from various nodes are satisfied while …

Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities

MH Chehreghani, A Bifet, T Abdessalem - arxiv preprint arxiv:1810.10094, 2018 - arxiv.org
An important index widely used to analyze social and information networks is betweenness
centrality. In this paper, first given a directed network $ G $ and a vertex $ r\in V (G) $, we …

[PDF][PDF] Exact and approximate algorithms for computing betweenness centrality in directed graphs

MH Chehreghani, A Bifet… - Fundamenta …, 2021 - fi.episciences.org
Graphs (networks) are an important tool to model data in different domains. Realworld
graphs are usually directed, where the edges have a direction and they are not symmetric …