Approximating Betweenness Centrality

DOI10.1007/978-3-540-77004-6_10MaRDI QIDQ5458305zbMATH OpenOpenAlexFDO

Authors David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail

Publication date 11 April 2008

Published in Algorithms and Models for the Web-Graph (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77004-6_10

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• Better approximation of betweenness centrality
• Fast Approximation of Centrality
• Fast approximation of centrality
• Fully-dynamic approximation of betweenness centrality
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Exact and approximate algorithms for computing betweenness centrality in directed graphs
• Approximating betweenness centrality in large evolving networks
• Fast approximation of betweenness centrality through sampling
• CENTRALITY ESTIMATION IN LARGE NETWORKS

Cited in

(36)

• scientific article; zbMATH DE number 6096696 (Why is no real title available?)
• Topology manipulations for speeding betweenness centrality computation
• A faster algorithm to update betweenness centrality after node alteration
• Towards classifying the polynomial-time solvability of temporal betweenness centrality
• Exact and approximate algorithms for computing betweenness centrality in directed graphs
• Fast approximation of betweenness centrality through sampling
• Large-scale network analysis
• Fully-dynamic approximation of betweenness centrality
• Routing betweenness centrality
• Maximum betweenness centrality: approximability and tractable cases
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Measuring centrality by a generalization of degree
• Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
• Network Analysis
• Fast approximation of centrality
• STACS 2005
• Into the square: on the complexity of some quadratic-time solvable problems
• KADABRA is an adaptive algorithm for betweenness via random approximation
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Compressive sensing of high betweenness centrality nodes in networks
• Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
• scientific article; zbMATH DE number 7075920 (Why is no real title available?)
• Better approximation of betweenness centrality
• Fast Approximation of Centrality
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Centrality measure in graphs
• A faster algorithm for betweenness centrality*
• Some results on approximate 1-median selection in metric spaces
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Approximating betweenness centrality in large evolving networks
• Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
• The critical node detection problem in networks: a survey
• A shortest path approximation algorithm for complex network analysis
• Incorporating auxiliary information in betweenness measure for input-output networks
• Subcubic equivalences between graph centrality problems, APSP and diameter
• Percolation centrality via Rademacher Complexity

This page was built for publication: Approximating Betweenness Centrality

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