Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs - Télécom Paris Access content directly
Conference Papers Year : 2018

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

Mostafa Haghir Chehreghani
  • Function : Author
Albert Bifet
Not file

Dates and versions

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

Identifiers

  • HAL Id : hal-02412377 , version 1

Cite

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⟩
19 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More