Geodesic
Computing Betweenness Centrality in Link Streams
Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 3, pp. 195-217.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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.
DOI : 10.7155/jgaa.00620
Keywords: graph, algorithm, complex network, betweenness, centrality, link stream, temporal graph, temporal network, dynamic graph 
@article{JGAA_2023_27_3_a1,
     author = {Fr\'ed\'eric Simard and Cl\'emence Magnien and Matthieu Latapy},
     title = {Computing {Betweenness} {Centrality} in {Link} {Streams}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {195--217},
     publisher = {mathdoc},
     volume = {27},
     number = {3},
     year = {2023},
     doi = {10.7155/jgaa.00620},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00620/}
}
TY  - JOUR
AU  - Frédéric Simard
AU  - Clémence Magnien
AU  - Matthieu Latapy
TI  - Computing Betweenness Centrality in Link Streams
JO  - Journal of Graph Algorithms and Applications
PY  - 2023
SP  - 195
EP  - 217
VL  - 27
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00620/
DO  - 10.7155/jgaa.00620
LA  - en
ID  - JGAA_2023_27_3_a1
ER  - 
%0 Journal Article
%A Frédéric Simard
%A Clémence Magnien
%A Matthieu Latapy
%T Computing Betweenness Centrality in Link Streams
%J Journal of Graph Algorithms and Applications
%D 2023
%P 195-217
%V 27
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00620/
%R 10.7155/jgaa.00620
%G en
%F JGAA_2023_27_3_a1
Frédéric Simard; Clémence Magnien; Matthieu Latapy. Computing Betweenness Centrality in Link Streams. Journal of Graph Algorithms and Applications, Tome 27 (2023) no. 3, pp. 195-217. doi : 10.7155/jgaa.00620. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00620/

Cité par Sources :