A Faster Algorithm to Update Betweenness Centrality after Node Alteration

DOI10.1007/978-3-319-03536-9_14zbMath1342.05032OpenAlexW3029414252MaRDI QIDQ2938029

Rishi Ranjan Singh, Keshav Goel, Sukrit, Sudarshan Iyengar

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

minimum cycle basisbetweenness centralitybi-connected components

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 (3)

Fully-Dynamic Approximation of Betweenness Centrality ⋮ Efficient algorithms for updating betweenness centrality in fully dynamic graphs ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks

Cites Work

• Unnamed Item
• Simple linear time approximation algorithm for betweenness
• The centrality index of a graph
• A faster algorithm for betweenness centrality*
• Better Approximation of Betweenness Centrality
• Depth-First Search and Linear Graph Algorithms
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Networks

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