About this document
Temporal Betweenness Centrality Algorithms by Aapu mallick is a document available to read on EtoBox.
This document discusses the computation of betweenness centrality in temporal graphs, which are essential for analyzing time-varying networks like social and transportation systems. It introduces exact and approximate algorithms for calculating temporal betweenness centrality, highlighting their efficiency improvements over existing methods. The proposed algorithms are validated through extensive experiments on real-world temporal networks, demonstrating significant performance gains.
- Author
- Aapu mallick
- Language
- EN