Compute the approximate current-flow betweenness centrality for nodes.
Approximates the current-flow betweenness centrality within absolute error of epsilon with high probability [R167].
Parameters: | G : graph
normalized : bool, optional (default=True)
weight : string or None, optional (default=’weight’)
dtype: data type (float) :
solver: string (default=’lu’) :
epsilon: float :
kmax: int :
|
---|---|
Returns: | nodes : dictionary
|
See also
Notes
The running time is \(O((1/\epsilon^2)m{\sqrt k} \log n)\) and the space required is \(O(m)\) for n nodes and m edges.
If the edges have a ‘weight’ attribute they will be used as weights in this algorithm. Unspecified weights are set to 1.
References
[R167] | (1, 2) Centrality Measures Based on Current Flow. Ulrik Brandes and Daniel Fleischer, Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS ‘05). LNCS 3404, pp. 533-544. Springer-Verlag, 2005. http://www.inf.uni-konstanz.de/algo/publications/bf-cmbcf-05.pdf |