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

Document type :
Conference papers
Complete list of metadatas

https://hal.telecom-paristech.fr/hal-02412410
Contributor : Telecomparis Hal <>
Submitted on : Sunday, December 15, 2019 - 1:02:40 PM
Last modification on : Thursday, December 19, 2019 - 1:06:05 AM

Identifiers

  • HAL Id : hal-02412410, version 1

Citation

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⟩

Share

Metrics

Record views

23