"Efficient Exact and Approximate Algorithms for Computing Betweenness ..."

Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-93040-4_59

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pakdd/ChehreghaniBA18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pakdd/ChehreghaniBA18
Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem:
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. PAKDD (3) 2018: 752-764

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.