Centrality in valued graphs: A measure of betweenness based on network flow

Abstract

A new measure of centrality, CF, is introduced. It is based on the concept of network flows. While conceptually similar to Freeman's original measure, CB, the new measure differs from the original in two important ways. First, CF is defined for both valued and non-valued graphs. This makes CF applicable to a wider variety of network datasets. Second, the computation of CF is not based on geodesic paths as is CB but on all the independent paths between all pairs of points in the network. © 1991.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Powers of the ideal of lebesgue measure zero sets.Maxim R. Burke - 1991 - Journal of Symbolic Logic 56 (1):103-107.
On Neutrosophic Graph.A. A. Salama - 2020 - Neutrosophic Knowledge 1:9-13.

Analytics

Added to PP
2017-05-27

Downloads
11 (#1,430,561)

6 months
3 (#1,491,886)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references