 |
- Home
- Submit
-
Browse
- By laboratory
- By department
-
By researchteam
- ACES - Autonomic and Critical Embedded Systems
- CCN - Cybersecurity for Communication and Networking
- COMNUM - Communications numériques
- LinkC2S - Circuits et Systèmes de communication
- DIG - Data, Intelligence and Graphs
- DIVA - Design, Interaction, Visualization and Applications
- ECOGE - Economie Gestion
- GTO - Télécommunications Optiques
- IMAGES - Image, Modélisation, Analyse, GEométrie, Synthèse
- IQA - Information Quantique et Applications
- LabSoC - System on Chip
- MC2 - Mathématiques discrètes, Codage et Cryptographie
- MM- Multimédia
- RFM2 - Radio-Fréquences Microondes et Ondes Millimétriques
- RMS - Réseaux, Mobilité et Services
- S2A - Signal, Statistique et Apprentissage
- SID - Sociologie, Information-Communication Design
- SPE - Sociologie, Psychologie ergonomique
- SSH - Secure and Safe Hardware
- By doctype
- Browse by author
- Search
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
Mostafa Haghir Chehreghani
Author
Albert Bifet
Author
Talel Abdessalem 1, 2
Mail :
Author IdHAL : talel-abdessalem ORCID : https://orcid.org/0000-0001-7673-4498
1
DIG - Data, Intelligence and Graphs (Télécom ParisTech
46, rue Barrault - France)
- LTCI - Laboratoire Traitement et Communication de l'Information (46 rue Barrault F-75634 Paris Cedex 13 - France)
- Télécom ParisTech (46 rue Barrault 75634 Paris Cedex 13 - France)
- IMT - Institut Mines-Télécom [Paris] (37-39 Rue Dareau, 75014 Paris - France)
2
INFRES - Département Informatique et Réseaux (46, rue Barrault
75013 Paris - France)
- Télécom ParisTech (46 rue Barrault 75634 Paris Cedex 13 - France)
Document type :
Conference papers
Complete list of metadatas
https://hal.telecom-paris.fr/hal-02412377
Contributor : Telecomparis Hal <>
Submitted on : Sunday, December 15, 2019 - 1:01:09 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:55 PM
Contributor : Telecomparis Hal <>
Submitted on : Sunday, December 15, 2019 - 1:01:09 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:55 PM
Identifiers
- HAL Id : hal-02412377, version 1
Collections
PARISTECH | INFRES | DIG | LTCI | UNIV-PARIS-SACLAY | 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⟩
Metrics
Record views
