Betweenness Centrality

Given a graph G=(V,E)G = (V, E) and a vertex vVv \in V, calculate the betweenness centrality of vertex vv (or the proportion of shortest paths that go through vv), i.e. BC(v):=stvVσst(v)σstBC(v) := \sum\limits_{s\neq t \neq v \in V} \frac{\sigma_{st}(v)}{\sigma_{st}} where σst(v)\sigma_{st}(v) is the number of shortest paths from ss to tt that go through vv and σst\sigma_{st} is the number of shortest paths from ss to tt.

Parameters

  • nn: number of nodes
  • mm: number of edges

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table