A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
[chapter]
2018
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)
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, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than computing closeness for all nodes in real-world networks. However, for networks that evolve over time, no
doi:10.1137/1.9781611975055.3
dblp:conf/alenex/BiseniusBAM18
fatcat:hf6wjs7uhzdebg6nrv7zdellvy