KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
From MaRDI portal
Recommendations
Cites work
- A faster algorithm for betweenness centrality*
- A note on the complexity of computing the number of reachable vertices in a digraph
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Adaptive Sampling for k-Means Clustering
- Alternative Route Graphs in Road Networks
- An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs
- Approximating Betweenness Centrality
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Complex graphs and networks
- Computing top-k closeness centrality faster in unweighted graphs
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
- Fast approximation of betweenness centrality through sampling
- Fast Approximation of Centrality
- Fully-dynamic approximation of betweenness centrality
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 6917138 (Why is no real title available?)
- scientific article; zbMATH DE number 3351222 (Why is no real title available?)
- Network Analysis
- Networks, crowds and markets. Reasoning about a highly connected world.
- Networks. An introduction.
- On a conditionally Poissonian graph process
- Query size estimation by adaptive sampling
- Random graphs and complex networks. Volume 1
- Routing betweenness centrality
- The diameter of sparse random graphs
- The phase transition in inhomogeneous random graphs
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Which problems have strongly exponential complexity?
Cited in
(8)- Incorporating auxiliary information in betweenness measure for input-output networks
- KADABRA is an adaptive algorithm for betweenness via random approximation
- Deterministic performance guarantees for bidirectional BFS on real-world networks
- Finding groups with maximum betweenness centrality via integer programming with random path sampling
- On the external validity of average-case analyses of graph algorithms
- On the external validity of average-case analyses of graph algorithms
- Deterministic performance guarantees for bidirectional BFS on real-world networks
- Sublinear time shortest path in expander graphs
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 Q4629536)
