Centrality measures based on current flow

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 533-544

  Brandes, Ulrik ^a   Fleischer, Daniel ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER NETWORKS; ELECTRIC CURRENTS; MATHEMATICAL MODELS;

CENTRALITY MEASURES; COMPUTING MEASURES; CURRENT FLOW;

INFORMATION SCIENCE;

EID: 24144445591     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_44     Document Type: Conference Paper

References (22)

1. Anthonisse, J.M.: The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematisch Centrum, Amsterdam (1971)
2. Beauchamp, M.A.: An improved index of centrality. Behavioral Science 10 (1965) 161-163
3. Bollobás, B.: Modern Graph Theory. Springer (1998)
4. Borgatti, S.P.: Centrality and Network Flow. Social Networks (to appear)
5. Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25 (2001) 163-177
6. Brandes, U., Erlebach, T., Eds.: Network Analysis. Springer LNCS (to appear)
7. Cuthill, E.H., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. Proceedings of the 24th ACM National Conference (1969) 157-172
8. Diaz, J., Petit, J., Serna, M.: A Survey of Graph Layout Problems. ACM Comput. Surv. 34 (2002) 313-356
9. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40 (1977) 35-41
10. Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: A measure of betweenness based on network flow. Social Networks 13 (1991) 141-154
11. Godsil, C., Royle, G.: Algebraic Graph Theory. Springer (2001)
12. Golub, G.H., van Loan, C.F.: Matrix Computations. Johns Hopkins University Press (1983)
13. Hackbusch, W.: Iterative Solution of Large Sparse Systems of Equations. Springer (1994)
14. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963) 13-30
15. Kinnersley, N.G.: The vertex separation number of a graph equals its path width. Information Processing Letters 42 (1992) 345-350
16. Kirchhoff, G.: Über die Auflösung der Gleichungen, auf weiche man bei der Untersuchung der Linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72 (1847) 497-508
17. Lengauer, T.: Black-white pebbles and graph separation. Acta Informatica 16 (1981) 465-475
18. Newman, M.E.J.: A Measure of betweenness centrality based on random walks. http://arxiv.org/abs/cond-mat/0309045 (2003)
19. Rosenthal, A., Pino, J.A.: A generalized algorithm for centrality problems on trees. Journal of the ACM 36 (1989) 349-381
20. Stephenson, K.A., Zelen, M.: Rethinking centrality: methods and examples. Social Networks 11 (1989) 1-37
21. Wang, J., Eppstein, D.: Fast approximation of centrality. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (2001) 228-229
22. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)