Fast Incremental Computation of Harmonic Closeness Centrality in Directed Weighted Networks
At the 11th IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2019), as part of the MSNDS workshop Leiden CNS Lab student Hanjo Boekhout will present the following paper about fast computation of closeness centrality in evolving directed networks:
- K. Putman, H.D. Boekhout and F.W. Takes, Fast Incremental Computation of Harmonic Closeness Centrality in Directed Weighted Networks, to appear in Proceedings of the 11th IEEE/ACM International Conference on Advances in Social Network Analysis and Mining (ASONAM), ACM, 2019.