DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs - Télécom Paris Access content directly
Conference Papers Year : 2018

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

Mostafa Haghir Chehreghani
  • Function : Author
Albert Bifet
Not file

Dates and versions

hal-02412410 , version 1 (15-12-2019)

Identifiers

  • HAL Id : hal-02412410 , version 1

Cite

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs. IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018, 2018, Seattle, United States. pp.2114-2123. ⟨hal-02412410⟩
28 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More