Computing Betweenness Centrality in Link Streams - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Graph Algorithms and Applications Année : 2023

Computing Betweenness Centrality in Link Streams

Résumé

Betweeness centrality is one of the most important concepts in graph analysis. It was recently extended to link streams, a graph generalization where links arrive over time. However, its computation raises non-trivial issues, due in particular to the fact that time is considered as continuous. We provide here the first algorithms to compute this generalized betweenness centrality, as well as several companion algorithms that have their own interest. They work in polynomial time and space, we illustrate them on typical examples, and we provide an implementation.
Fichier principal
Vignette du fichier
2102.06543.pdf (348.08 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04305734 , version 1 (24-11-2023)

Identifiants

Citer

Frédéric Simard, Clémence Magnien, Matthieu Latapy. Computing Betweenness Centrality in Link Streams. Journal of Graph Algorithms and Applications, 2023, 27 (3), pp.195-217. ⟨10.7155/jgaa.00620⟩. ⟨hal-04305734⟩
15 Consultations
20 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More