Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

Document type :
Conference papers
Complete list of metadatas

https://hal.telecom-paristech.fr/hal-02412377
Contributor : Telecomparis Hal <>
Submitted on : Sunday, December 15, 2019 - 1:01:09 PM
Last modification on : Wednesday, January 8, 2020 - 1:06:22 AM

Identifiers

  • HAL Id : hal-02412377, version 1

Citation

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem. Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. PAKDD (3), 2018, Melbourne, Australia. pp.752-764. ⟨hal-02412377⟩

Share

Metrics

Record views

7