Better approximation of betweenness centrality
From MaRDI portal
Recommendations
Cited in
(31)- Fast approximation of betweenness centrality through sampling
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- Incorporating auxiliary information in betweenness measure for input-output networks
- Heuristical top-\(k\): fast estimation of centralities in complex networks
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- A Faster Algorithm to Update Betweenness Centrality after Node Alteration
- Maximum betweenness centrality: approximability and tractable cases
- Large-scale network analysis
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
- Some results on approximate 1-median selection in metric spaces
- Improving the betweenness centrality of a node by adding links
- Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
- Faster computation of successive bounds on the group betweenness centrality
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- Fully Dynamic 2-Hop Cover Labeling
- Topology manipulations for speeding betweenness centrality computation
- A faster algorithm to update betweenness centrality after node alteration
- Exact and approximate algorithms for computing betweenness centrality in directed graphs
- An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
- Approximating betweenness centrality in large evolving networks
- ReHub: extending hub labels for reverse k-nearest neighbor queries on large-scale networks
- Approximating Betweenness Centrality
- STACS 2005
- Approximating Betweenness Centrality in Fully Dynamic Networks
- CENTRALITY ESTIMATION IN LARGE NETWORKS
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
- Generic network sparsification via degree- and subgraph-based edge sampling
- Network analytics for insurance fraud detection: a critical case study
- Generic network sparsification via hybrid edge sampling
- On the maximum betweenness improvement problem
This page was built for publication: Better approximation of betweenness centrality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233512)
