Routing betweenness centrality

Shlomi Dolev, Yuval Elovici, Rami Puzis

Journal of ACM 57(4) (2010)

DOI: 10.1145/1734213.1734219

This paper presents algorithms for computing Routing Betweenness Centrality (RBC) of all the individual vertices in a network and algorithms for computing the RBC of a given group of vertices, where the RBC of a group of vertices represents their potential to collaboratively monitor and control data flows in the network.