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]
@article{ChehreghaniBA21,
title = {Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs},
author = {Mostafa Haghir Chehreghani and Albert Bifet and Talel Abdessalem},
year = {2021},
doi = {10.3233/FI-2021-2071},
url = {https://doi.org/10.3233/FI-2021-2071},
researchr = {https://researchr.org/publication/ChehreghaniBA21},
cites = {0},
citedby = {0},
journal = {Fundamenta Informaticae},
volume = {182},
number = {3},
pages = {219-242},
}