Cited in
(8)- Exact and approximate algorithms for computing betweenness centrality in directed graphs
- KADABRA is an adaptive algorithm for betweenness via random approximation
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Compressive sensing of high betweenness centrality nodes in networks
- NetworKit
- ionet
- Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
- Incorporating auxiliary information in betweenness measure for input-output networks
This page was built for software: KADABRA
