Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs

DOI10.3233/FI-2021-2071OpenAlexW3216770752MaRDI QIDQ5025042

Talel Abdessalem, Albert Bifet, Mostafa Haghir Chehreghani

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08739

zbMATH Keywords

social networksdirected graphsexact algorithmapproximate algorithmbetweenness centrality

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection

Uses Software

• KADABRA

Cites Work

• Fast approximation of betweenness centrality through sampling
• A faster algorithm for betweenness centrality*
• Emergence of Scaling in Random Networks
• The centrality of groups and classes
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Improving the Betweenness Centrality of a Node by Adding Links
• Approximating Betweenness Centrality in Large Evolving Networks
• Better Approximation of Betweenness Centrality
• Probability Inequalities for Sums of Bounded Random Variables
• Approximating Betweenness Centrality
• Understanding Machine Learning
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs