Exact and approximate algorithms for computing betweenness centrality in directed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5663542 (Why is no real title available?)
- A faster algorithm for betweenness centrality*
- Approximating Betweenness Centrality
- Approximating betweenness centrality in large evolving networks
- Better approximation of betweenness centrality
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- Community structure in social and biological networks
- Emergence of Scaling in Random Networks
- Fast approximation of betweenness centrality through sampling
- Improving the betweenness centrality of a node by adding links
- KADABRA is an adaptive algorithm for betweenness via random approximation
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Probability Inequalities for Sums of Bounded Random Variables
- The Structure and Function of Complex Networks
- The centrality of groups and classes
- Understanding machine learning. From theory to algorithms
Cited in
(7)- Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
- Approximating Betweenness Centrality
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- scientific article; zbMATH DE number 7075920 (Why is no real title available?)
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Faster computation of successive bounds on the group betweenness centrality
This page was built for publication: Exact and approximate algorithms for computing betweenness centrality in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025042)
