KADABRA is an adaptive algorithm for betweenness via random approximation

DOI10.4230/LIPICS.ESA.2016.20zbMATH Open1397.68137MaRDI QIDQ4606289FDOQ4606289

Michele Borassi, Emanuele Natale

Publication date: 2 March 2018

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

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)

Cited In (6)

• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Hyperbolic Embeddings for Near-Optimal Greedy Routing
• Title not available (Why is that?)
• Compressive sensing of high betweenness centrality nodes in networks
• Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
• Improving the Betweenness Centrality of a Node by Adding Links

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)