Please use this identifier to cite or link to this item: https://dspace.ctu.edu.vn/jspui/handle/123456789/63981
Title: A method to improve the time of computing betweenness centrality in social network graph
Authors: Nguyen, Xuan Dung
Doan, Van Ban
Do, Thi Bich Ngoc
Keywords: Betweenness centrality
Mining graph data
Analyzing the social network
Issue Date: 2019
Series/Report no.: Vietnam Journal of Science and Technology;Vol. 57, No. 03 .- P.344-355
Abstract: The Betweenness centrality is an important metric in the graph theory and can be applied in the analyzing social network. The main researches about Betweenness centrality often focus on reducing the complexity. Nowadays, the number of users in the social networks is huge. Thus, improving the computing time of Betweenness centrality to apply in the social network is neccessary. In this paper, we propose the algorithm of computing Betweenness centrality by reduce the similar nodes in the graph in order to reducing computing time. Our experiments with graph networks result shows that the computing time of the proposed algorithm is less than Brandes algorithm. The proposed algorithm is compared with the Brandes algorithm in term of execution time.
URI: https://dspace.ctu.edu.vn/jspui/handle/123456789/63981
ISSN: 2525-2518
Appears in Collections:Vietnam journal of science and technology

Files in This Item:
File Description SizeFormat 
_file_
  Restricted Access
3.41 MBAdobe PDF
Your IP: 100.24.20.141


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.