KADABRA is an adaptive algorithm for betweenness via random approximation

DOI10.4230/LIPICS.ESA.2016.20MaRDI QIDQ4606289zbMATH OpenFDO

Authors Michele Borassi, Emanuele Natale

Publication date 2 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2016.20

zbMATH Keywords

samplingnetwork analysisgraph miningshortest path algorithmbetweenness centrality

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25)

Recommendations

• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Approximating Betweenness Centrality
• Fast approximation of betweenness centrality through sampling
• Approximating betweenness centrality in large evolving networks
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality

Cited in

(7)

• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Exact and approximate algorithms for computing betweenness centrality in directed graphs
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Improving the betweenness centrality of a node by adding links
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Compressive sensing of high betweenness centrality nodes in networks
• Efficient shortest paths in scale-free networks with underlying hyperbolic geometry

Describes a project that uses

Uses Software

• KADABRA

This page was built for publication: KADABRA is an adaptive algorithm for betweenness via random approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606289)