14 Sep 2004
CS 5244 – Bibliometrics
31
Distance Centrality
¡Closeness = minimal
distance
¡Sum of shortest paths
should be minimal in a central graph
¡(Jordan) Center =
subset of nodes that have minimal sum distance to all nodes.
¡What
about disconnected components?