Skip to Main content Skip to Navigation
Conference papers

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

Mostafa Haghir Chehreghani Albert Bifet Talel Abdessalem 1, 2
1 DIG - Data, Intelligence and Graphs
LTCI - Laboratoire Traitement et Communication de l'Information
2 INFRES - Département Informatique et Réseaux
Document type :
Conference papers
Complete list of metadata
https://hal.telecom-paris.fr/hal-02412377
Contributor : Telecomparis Hal Connect in order to contact the contributor
Submitted on : Sunday, December 15, 2019 - 1:01:09 PM
Last modification on : Tuesday, October 19, 2021 - 11:14:16 AM

Identifiers

  • HAL Id : hal-02412377, version 1

Collections

PARISTECH | INFRES | DIG | LTCI | INSTITUT-TELECOM

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

50