Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs.

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem

Browse the full PAKDD paper archive.