Computing Betweenness Centrality in Link Streams

被引：0
|
作者：
Simard F. [1 ]
Magnien C. [1 ]
Latapy M. [1 ]
机构：
[1] Sorbonne University, CNRS, LIP6, Paris
来源：
Journal of Graph Algorithms and Applications | 2023年 / 27卷 / 03期
关键词：
Compendex;
D O I：
10.7155/jgaa.00620
中图分类号：
学科分类号：
摘要：
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. © 2023, Brown University. All rights reserved.
引用
收藏
页码：195 / 217
页数：22
相关论文
共 50 条
  • [1] Computing Betweenness Centrality in External Memory
    Arge, Lars
    Goodrich, Michael T.
    van Walderveen, Freek
    2013 IEEE INTERNATIONAL CONFERENCE ON BIG DATA, 2013,
  • [2] Distributed and Parallel Algorithm for Computing Betweenness Centrality
    Campuzano-Alvarez, Mirlayne
    Fonseca-Bruzon, Adrian
    PROGRESS IN PATTERN RECOGNITION, IMAGE ANALYSIS, COMPUTER VISION, AND APPLICATIONS, CIARP 2016, 2017, 10125 : 184 - 191
  • [3] Distributed and Parallel Algorithm for Computing Betweenness Centrality
    Campuzano-Alvarez, Mirlayne
    Fonseca-Bruzon, Adrian
    ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2016, 2016, 10022 : 285 - 296
  • [4] Computing Betweenness Centrality in B-hypergraphs
    Lee, Kwang Hee
    Kim, Myoung Ho
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 2147 - 2150
  • [5] Nearly Optimal Distributed Algorithm For Computing Betweenness Centrality
    Hua, Qiang-Sheng
    Fan, Haoqiang
    Ai, Ming
    Qian, Lixiang
    Li, Yangyang
    Shi, Xuanhua
    Jin, Hai
    PROCEEDINGS 2016 IEEE 36TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS ICDCS 2016, 2016, : 271 - 280
  • [6] A Comparison of Approaches to Computing Betweenness Centrality for Large Graphs
    Matta, John
    COMPLEX NETWORKS & THEIR APPLICATIONS VI, 2018, 689 : 3 - 13
  • [7] Link prediction using betweenness centrality and graph neural networks
    Jibouni Ayoub
    Dounia Lotfi
    Ahmed Hammouch
    Social Network Analysis and Mining, 13
  • [8] Link prediction using betweenness centrality and graph neural networks
    Ayoub, Jibouni
    Lotfi, Dounia
    Hammouch, Ahmed
    SOCIAL NETWORK ANALYSIS AND MINING, 2022, 13 (01)
  • [9] Distributively Computing Random Walk Betweenness Centrality in Linear Time
    Hua, Qiang-Sheng
    Ai, Ming
    Jin, Hai
    Yu, Dongxiao
    Shi, Xuanhua
    2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017), 2017, : 764 - 774
  • [10] Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
    Chehreghani, Mostafa Haghir
    Bifet, Albert
    Abdessalem, Talel
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 219 - 242
12345