Efficient parallel algorithms for dynamic closeness‐ and betweenness centrality

Finding the centrality measures of nodes in a graph is a problem of fundamental importance due to various applications from social networks, biological networks, and transportation networks. Given the large size of such graphs, it is natural to use parallelism as a recourse. Several studies show how...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 35; no. 17
Main Authors:	Regunta, Sai Charan, Tondomker, Sai Harsh, Shukla, Kshitij, Kothapalli, Kishore
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.08.2023
Subjects:	Algorithms batch updates betweenness‐centrality closeness‐centrality Corresponding states CPU dynamic graph algorithms GPU Graphics processing units Graphs Nodes parallel algorithms Social networks Transportation networks
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!