An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge

DOI10.1093/COMNET/CNAC033zbMath1496.05089OpenAlexW4290692417MaRDI QIDQ5103944

Yoshiki Satotani, Tsuyoshi Migita, Norikazu Takahashi

Publication date: 9 September 2022

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comnet/cnac033

zbMATH Keywords

algorithmshortest pathtime complexitybetweenness centralitydynamic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

This page was built for publication: An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge