A Faster Algorithm to Update Betweenness Centrality After Node Alteration

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

doi:10.1080/15427951.2014.982311

Loading [Contrib]/a11y/accessibility-menu.js

General

Vol. 11, Issue 4, 2015

September 02, 2015 EDT

A Faster Algorithm to Update Betweenness Centrality After Node Alteration

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

math

• https://doi.org/10.1080/15427951.2014.982311

Internet Mathematics

Iyengar, S. R. S., Rishi Ranjan Singh, Keshav Goel, and Sukrit Gupta. 2015. “A Faster Algorithm to Update Betweenness Centrality After Node Alteration.” Internet Mathematics 11 (4). https://doi.org/10.1080/15427951.2014.982311.

View more stats