A Faster Algorithm to Update Betweenness Centrality after Node Alteration

DOI10.1007/978-3-319-03536-9_14MaRDI QIDQ2938029zbMATH OpenOpenAlexFDO

Authors Keshav Goel, Rishi Ranjan Singh, Sudarshan Iyengar, Sukrit

Publication date 13 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03536-9_14

zbMATH Keywords

betweenness centralitybi-connected componentsminimum cycle basis

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
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• A faster algorithm for betweenness centrality*
• scientific article; zbMATH DE number 6917138
• Community based node betweenness centrality updating algorithms in dynamic networks
• Betweenness centrality -- incremental and faster
• An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge
• Better approximation of betweenness centrality
• Topology manipulations for speeding betweenness centrality computation
• Improving the betweenness centrality of a node by adding links

Cites work

• A faster algorithm for betweenness centrality*
• Better approximation of betweenness centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Depth-First Search and Linear Graph Algorithms
• Networks. An introduction.
• Simple linear time approximation algorithm for betweenness
• Social and economic networks.
• The centrality index of a graph

Cited in

(8)

• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Fully-dynamic approximation 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
• A faster algorithm to update betweenness centrality after node alteration
• An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
• Approximating Betweenness Centrality in Fully Dynamic Networks
• 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 Q2938029)