Reach Centrality

The reach centrality of a node ww is the smallest distance rr such that any s−ts-t shortest path passing through ww has either ss or tt in the ball of radius rr around ww.

Parameters

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

Related Problems

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 3 of 3 reductions

Other relevant algorithms

Insuffient Data to display table