A Faster Algorithm to Update Betweenness Centrality After Node Alteration

DOI10.1080/15427951.2014.982311zbMath1461.05080OpenAlexW2036603787MaRDI QIDQ4985797

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

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

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

Related Items (2)

High-order degree and combined degree in complex networks ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic

Cites Work

• Unnamed Item
• Simple linear time approximation algorithm for betweenness
• The centrality index of a graph
• A faster algorithm for betweenness centrality*
• Betweenness Centrality – Incremental and Faster
• Topology manipulations for speeding betweenness centrality computation
• Better Approximation of Betweenness Centrality
• Approximating Betweenness Centrality
• Automata, Languages and Programming
• Depth-First Search and Linear Graph Algorithms
• Network Analysis
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Networks

This page was built for publication: A Faster Algorithm to Update Betweenness Centrality After Node Alteration