Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. Fundamenta Informaticae, 182(3):219-242, 2021. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: