160 citations · 163 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities
Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem
An important index widely used to analyze social and information networks is betweenness centrality. In this paper, first given a directed network and a vertex , we…
cs.DS2017
Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks
Mostafa Haghir Chehreghani, Talel Abdessalem, and Albert Bifet
Betweenness centrality is an important index widely used in different domains such as social networks, traffic networks and the world wide web. However, even for mid-size networks…