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]

@inproceedings{ChehreghaniBA18a,
  title = {DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs},
  author = {Mostafa Haghir Chehreghani and Albert Bifet and Talel Abdessalem},
  year = {2018},
  doi = {10.1109/BigData.2018.8622452},
  url = {https://doi.org/10.1109/BigData.2018.8622452},
  researchr = {https://researchr.org/publication/ChehreghaniBA18a},
  cites = {0},
  citedby = {0},
  pages = {2114-2123},
  booktitle = {IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018},
  editor = {Naoki Abe and Huan Liu 0001 and Calton Pu and Xiaohua Hu and Nesreen Ahmed and Mu Qiao and Yang Song and Donald Kossmann and Bing Liu 0001 and Kisung Lee and Jiliang Tang and Jingrui He and Jeffrey Saltz},
  publisher = {IEEE},
  isbn = {978-1-5386-5035-6},
}