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