eprintid: 4530
rev_number: 6
eprint_status: archive
userid: 322
dir: disk0/00/00/45/30
datestamp: 2021-06-28 02:32:49
lastmod: 2021-06-28 02:32:49
status_changed: 2021-06-28 02:32:49
type: article
metadata_visibility: show
creators_name: Duong, Ngoc Son
creators_name: Du, Phuong Hanh
creators_name: Nguyen, Ngoc Cuong
creators_name: Nguyen, Ngoc Hoa
creators_id: duongngocson89@gmail.com
creators_id: hanhdp@vnu.edu.vn
creators_id: cuongnn.hvan@gmail.com
creators_id: hoa.nguyen@vnu.edu.vn
title: A Graph Reduction Method for Improving the Computation of Betweenness Centrality in Large-Scale Graphs
ispublished: inpress
subjects: IT
subjects: Scopus
divisions: fac_fit
date: 2021-08
date_type: published
publisher: Science and Information (SAI)
full_text_status: none
publication: International Journal of Advanced Computer Science and Applications (IJACSA)
refereed: FALSE
issn: 2156-5570
citation:   Duong, Ngoc Son and Du, Phuong Hanh and Nguyen, Ngoc Cuong and Nguyen, Ngoc Hoa  (2021) A Graph Reduction Method for Improving the Computation of Betweenness Centrality in Large-Scale Graphs.  International Journal of Advanced Computer Science and Applications (IJACSA) .    ISSN 2156-5570    (In Press)