DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs. In Naoki Abe, Huan Liu 0001, Calton Pu, Xiaohua Hu, Nesreen Ahmed, Mu Qiao, Yang Song, Donald Kossmann, Bing Liu 0001, Kisung Lee, Jiliang Tang, Jingrui He, Jeffrey Saltz, editors, IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018. pages 2114-2123, IEEE, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.