Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2021

Dates et versions

hal-04468412 , version 1 (20-02-2024)

Identifiants

Citer

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. Fundamenta Informaticae, 2021, 182 (3), pp.219--242. ⟨10.3233/FI-2021-2071⟩. ⟨hal-04468412⟩
3 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More