Skip to main navigation Skip to search Skip to main content

Vertex-centric parallel algorithms for identifying key vertices in large-scale graphs

  • Bo Li
  • , Zhuangliang Gao
  • , Jianwei Niu
  • , Yanfei Lv
  • , Hong Zhang
  • Beihang University
  • CNCERT/CC

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Betweenness centrality is a metric to measure the relative importance of vertices within a graph. The computation of betweenness centrality is based on shortest paths which requires O(n+m) space and O(mn) and O(nm+n2 log n) time on unweighted and weighted graphs, respectively. It is time-consuming to deal with large-scale graphs, which motivates us resort to distributed computing and parallel algorithms. In this paper, we design a vertex-based parallel algorithm following the shortest path approach (SPBC). Moreover, we propose a distributed algorithm based on message propagation(MPBC) to quantify the importance of vertices. MPBC takes into account the real situation of information diffusion in social networks. We implement our algorithms on Graphlab and evaluate them through comprehensive experiments. The results show that both SPBC and MPBC scale well with the increasing number of machines. SPBC on 2 machines outperforms the classical centralized algorithm by 1.59 times in terms of running time. MPBC can handle graph with ten millions of vertices and edges within an acceptable time where classical algorithms become infeasible.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages225-231
Number of pages7
ISBN (Electronic)9781479989362
DOIs
StatePublished - 23 Nov 2015
Event17th IEEE International Conference on High Performance Computing and Communications, IEEE 7th International Symposium on Cyberspace Safety and Security and IEEE 12th International Conference on Embedded Software and Systems, HPCC-ICESS-CSS 2015 - New York, United States
Duration: 24 Aug 201526 Aug 2015

Publication series

NameProceedings - 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security and 2015 IEEE 12th International Conference on Embedded Software and Systems, HPCC-CSS-ICESS 2015

Conference

Conference17th IEEE International Conference on High Performance Computing and Communications, IEEE 7th International Symposium on Cyberspace Safety and Security and IEEE 12th International Conference on Embedded Software and Systems, HPCC-ICESS-CSS 2015
Country/TerritoryUnited States
CityNew York
Period24/08/1526/08/15

Keywords

  • Key vertices
  • MPBC
  • Parallel algorithm
  • SPBC

Fingerprint

Dive into the research topics of 'Vertex-centric parallel algorithms for identifying key vertices in large-scale graphs'. Together they form a unique fingerprint.

Cite this