The following pages link to Fast Approximation of Centrality (Q4679080):
Displayed 12 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Data mining of social networks represented as graphs (Q465703) (← links)
- Centrality measure in graphs (Q977050) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation (Q4629536) (← links)
- CENTRALITY ESTIMATION IN LARGE NETWORKS (Q5900142) (← links)
- CENTRALITY ESTIMATION IN LARGE NETWORKS (Q5900143) (← links)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter (Q6051928) (← links)