Fast approximation of centrality

MaRDI QIDQ2768297zbMATH OpenFDO

Authors David Eppstein, Joseph Wang

Publication date 24 March 2002

zbMATH Keywords

social networkscentrality of a vertex

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Fast Approximation of Centrality
• Approximating Betweenness Centrality
• Fast approximation of betweenness centrality through sampling
• STACS 2005
• CENTRALITY ESTIMATION IN LARGE NETWORKS

Cited in

(11)

• Approximating Betweenness Centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• How to calculate the barycenter of a weighted graph
• scientific article; zbMATH DE number 7075920 (Why is no real title available?)
• Fast Approximation of Centrality
• Computing the eccentricity distribution of large graphs
• On the evaluation of graph centrality for shape matching
• Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures
• Faster computation of successive bounds on the group betweenness centrality
• Percolation centrality via Rademacher Complexity
• I/O-efficient calculation of H-group closeness centrality over disk-resident graphs

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 Q2768297)