Login / Signup
An algorithm for updating betweenness centrality scores of all vertices in a graph upon deletion of a single edge.
Yoshiki Satotani
Tsuyoshi Migita
Norikazu Takahashi
Published in:
J. Complex Networks (2022)
Keyphrases
</>
betweenness centrality
weighted graph
undirected graph
complex networks
graph structure
k means
hamiltonian cycle
segmentation algorithm
random graphs
graph model
graph based algorithm
minimum spanning tree
simulated annealing
graphical models
similarity measure
minimum weight
attributed graphs
segmentation method
markov chain