Fast Approximation of Centrality

DOI10.7155/jgaa.00081zbMath1090.68117OpenAlexW2567974767MaRDI QIDQ4679080

David Eppstein, Joseph Wang

Publication date: 25 May 2005

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/52454

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (12)

A lower bound for metric 1-median selection ⋮ On ultrametric 1-median selection ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored ⋮ Data mining of social networks represented as graphs ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ On Las Vegas approximations for metric 1-median selection ⋮ Fast approximation of betweenness centrality through sampling ⋮ Centrality measure in graphs ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS ⋮ CENTRALITY ESTIMATION IN LARGE NETWORKS

This page was built for publication: Fast Approximation of Centrality