Fast Approximation of Centrality

DOI10.7155/JGAA.00081MaRDI QIDQ4679080zbMATH OpenOpenAlexFDO

Authors David Eppstein, Joseph Wang

Publication date 25 May 2005

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Recommendations

• Fast approximation of centrality
• Approximating Betweenness Centrality
• Fast approximation of betweenness centrality through sampling
• STACS 2005
• Network Analysis

Cited in

(24)

• On ultrametric 1-median selection
• Fast approximation of betweenness centrality through sampling
• Deterministic metric 1-median selection with A 1-o(1) fraction of points ignored
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Approximating Betweenness Centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Deterministic metric 1-median selection with very few queries
• How to calculate the barycenter of a weighted graph
• Fast approximation of centrality
• STACS 2005
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
• scientific article; zbMATH DE number 7075920 (Why is no real title available?)
• Data mining of social networks represented as graphs
• Centrality measure in graphs
• A lower bound for metric 1-median selection
• Some results on approximate 1-median selection in metric spaces
• On the evaluation of graph centrality for shape matching
• An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs
• Faster computation of successive bounds on the group betweenness centrality
• On Las Vegas approximations for metric 1-median selection
• Subcubic equivalences between graph centrality problems, APSP and diameter
• A comparison of three algorithms for approximating the distance distribution in real-world graphs
• Percolation centrality via Rademacher Complexity

This page was built for publication: Fast Approximation of Centrality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679080)