DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs. Chehreghani, M. H., Bifet, A., & Abdessalem, T. In IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018, pages 2114–2123, 2018.
DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/bigdataconf/ChehreghaniBA18a,
  author    = {Mostafa Haghir Chehreghani and
               Albert Bifet and
               Talel Abdessalem},
  title     = {DyBED: An Efficient Algorithm for Updating Betweenness Centrality
               in Directed Dynamic Graphs},
  booktitle = {{IEEE} International Conference on Big Data, Big Data 2018, Seattle,
               WA, USA, December 10-13, 2018},
  pages     = {2114--2123},
  year      = {2018},
  crossref  = {DBLP:conf/bigdataconf/2018},
  url       = {https://doi.org/10.1109/BigData.2018.8622452},
  doi       = {10.1109/BigData.2018.8622452},
  timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/bigdataconf/ChehreghaniBA18a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0