Last modified 2 years ago
Reputation Function
Determine the most trustworthy peers in a self-organising system. Is required to be provide some resistance to sybil attack and other attacks forms.
Betweenness centrality
Please read attachments for details on this powerfull algorithm.
Attachments
-
23.pdf
(890.3 KB) -
added by dimitra@… 2 years ago.
A set of Measures of Centrality Based on Betweenness, by Freeman, Sociometry 1977
-
graph theoretic on centrality_k-BC.pdf
(207.5 KB) -
added by dimitra@… 2 years ago.
A graph-theoritic perspective on centrality, by SP Borgatti and MG Everett, Social Networks, 2006
-
b-fabc-01.pdf
(155.2 KB) -
added by dimitra@… 2 years ago.
A Faster Algorithm for Betweenness Centrality, by Ulrik Brandes,Journal of Mathematical Sociology, 2001
-
k_BC.pdf
(217.7 KB) -
added by dimitra@… 2 years ago.
On Variants of Shortest-Path Betweenness Centrality and their Generic Computation,by Ulrik Brandes,Social Networks, Vol. 30, 2008
-
0309436v2.pdf
(176.6 KB) -
added by dimitra@… 2 years ago.
Betweenness Centrality in Large Complex Networks, by Marc Barthelemy,The European Physical Journal B - Condensed Matter, Vol. 38, 2004
-
kBC-ICPP2009.pdf
(269.4 KB) -
added by dimitra@… 2 years ago.
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation, by K. Jiang, D. Ediger and D. A. Bader, International Conference on Parallel Processing, 2009
- asbs00.pdf (570.1 KB) - added by dimitra@… 2 years ago.
