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]

Authors

Mostafa Haghir Chehreghani

This author has not been identified. Look up 'Mostafa Haghir Chehreghani' in Google

Albert Bifet

This author has not been identified. Look up 'Albert Bifet' in Google

Talel Abdessalem

This author has not been identified. Look up 'Talel Abdessalem' in Google