A faster algorithm to update betweenness centrality after node alteration

DOI10.1080/15427951.2014.982311MaRDI QIDQ4985797zbMATH OpenOpenAlexFDO

Authors Rishi Ranjan Singh, Keshav Goel, S. R. S. Iyengar, Sukrit Gupta

Publication date 26 April 2021

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2014.982311

Mathematics Subject Classification ID

Distance in graphs (05C12) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• scientific article; zbMATH DE number 6917138
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Betweenness centrality -- incremental and faster
• Community based node betweenness centrality updating algorithms in dynamic networks

Cites work

• A faster algorithm for betweenness centrality*
• Approximating Betweenness Centrality
• Automata, Languages and Programming
• Better approximation of betweenness centrality
• Betweenness centrality -- incremental and faster
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Depth-First Search and Linear Graph Algorithms
• Network Analysis
• Networks. An introduction.
• Simple linear time approximation algorithm for betweenness
• Social and economic networks.
• The centrality index of a graph
• Topology manipulations for speeding betweenness centrality computation

Cited in

(10)

• High-order degree and combined degree in complex networks
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Optimizing node infiltrations in complex networks by a local search based heuristic
• Betweenness centrality -- incremental and faster
• A Faster Algorithm to Update Betweenness Centrality after Node Alteration
• Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
• scientific article; zbMATH DE number 6917138 (Why is no real title available?)
• Community based node betweenness centrality updating algorithms in dynamic networks
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques

This page was built for publication: A faster algorithm to update betweenness centrality after node alteration

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