3 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 2 cited
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman +1
Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However,…
cs.DS2015★ 3 cited
Fully-dynamic Approximation of Betweenness Centrality
Elisabetta Bergamini, Henning Meyerhenke
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths. Since an exact computation is prohibitive in la…