TY  - JOUR
AU  - Gómez González, Daniel
AU  - Llana Díaz, Luis Fernando
AU  - Pareja Flores, Cristóbal
PY  - 2022
DO  - 10.3897/jucs.80688
SN  - 0948-695X
UR  - https://hdl.handle.net/20.500.14352/112337
T2  - Journal of Universal Computer Science
AB  - The Brandes algorithm has the lowest computational complexity for computing the betweenness centrality measures of all nodes or edges in a given graph. Its numerous applications make it one of the most used algorithms in social network analysis. In...
LA  - eng
M2  - 160
PB  - Graz University of Technology
KW  - Spark
KW  - MapReduce
KW  - Social Network Analysis
KW  - Centrality measure
KW  - Brandes Algorithm
KW  - Distributed programming
TI  - A Spark parallel betweenness centrality computation and its application to community detection problems
TY  - journal article
VL  - 28
ER  -