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

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. In Dinh Q. Phung, Vincent S. Tseng, Geoffrey I. Webb, Bao Ho, Mohadeseh Ganji, Lida Rashidi, editors, Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, June 3-6, 2018, Proceedings, Part III. Volume 10939 of Lecture Notes in Computer Science, pages 752-764, Springer, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.