On computing distances and latencies in link streams
Frédéric Simard · 2019
Link Streams were proposed as a model of temporal networks. We seek to understand topological and temporal properties of those objects through efficiently computing the distances, latencies and lengths of shortest fastest paths. We develop different algorithms to compute those values. One purpose of this study is to help compute centrality functions on link streams such as the betweenness and the closeness.