Not logged in : Login |
Betweenness Centrality assigns importance to a node in a network based upon the number of times that node occurs within the paths between all pairs of nodes in a graph. That is, each node in the graph is paired with every other node; the shortest path between each pair of nodes is computed; and then the number of occurrences of each intermediate node in those shortest-paths is counted, to discover their relative importance.
Attributes | Values |
---|---|
description |
|
described by | |
name |
|
image | |
is in scheme | |
has broader | |
has related |
|
sameAs | |
type | |
is topic of | |
is has narrower of | |
is has related of | |
is about of | |
is sameAs of |