KADABRA

swMATH25810MaRDI QIDQ37545FDOQ37545

Author name not available (Why is that?)

Official website: http://drops.dagstuhl.de/opus/volltexte/2016/6371/

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
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry
• ionet
• Incorporating auxiliary information in betweenness measure for input-output networks

This page was built for software: KADABRA