Geodesic
Fast Approximation of Centrality
Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 39-45.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Social scientists use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized approximation algorithm for centrality in weighted graphs. For graphs exhibiting the small world phenomenon, our method estimates the centrality of all vertices with high probability within a (1+ε) factor in ~O(m) time. 
@article{JGAA_2004_8_1_a3,
     author = {David Eppstein and Joseph Wang},
     title = {Fast {Approximation} of {Centrality}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {39--45},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {2004},
     doi = {10.7155/jgaa.00081},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00081/}
}
TY  - JOUR
AU  - David Eppstein
AU  - Joseph Wang
TI  - Fast Approximation of Centrality
JO  - Journal of Graph Algorithms and Applications
PY  - 2004
SP  - 39
EP  - 45
VL  - 8
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00081/
DO  - 10.7155/jgaa.00081
LA  - en
ID  - JGAA_2004_8_1_a3
ER  - 
%0 Journal Article
%A David Eppstein
%A Joseph Wang
%T Fast Approximation of Centrality
%J Journal of Graph Algorithms and Applications
%D 2004
%P 39-45
%V 8
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00081/
%R 10.7155/jgaa.00081
%G en
%F JGAA_2004_8_1_a3
David Eppstein; Joseph Wang. Fast Approximation of Centrality. Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 39-45. doi : 10.7155/jgaa.00081. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00081/

Cité par Sources :