All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:28, 15 February 2023 Admin talk contribs created page Approximate Reach Centrality (Created page with "{{DISPLAYTITLE:Approximate Reach Centrality (Vertex Centrality)}} == Description == The reach centrality of a node $w$ is the smallest distance $r$ such that any $s-t$ shortest path passing through $w$ has either $s$ or $t$ in the ball of radius $r$ around $w$. Approximate reach centrality is the approximation version of the problem. == Related Problems == Generalizations: Reach Centrality Related: Eccentricity, All-Nodes Median Parity, Betweenness C...")