Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be perfo...

Full description

Bibliographic Details

Published in:	IEEE transactions on parallel and distributed systems Vol. 29; no. 3; pp. 659 - 672
Main Authors:	Jamour, Fuad, Skiadopoulos, Spiros, Kalnis, Panos
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Betweenness centrality dynamic graph algorithms Graphs Heuristic algorithms Measurement Memory management Network analysis Parallel algorithms parallel graph algorithms Random access memory Social network services State of the art
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!