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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Concurrency and computation Jg. 35; H. 17
Hauptverfasser:	Regunta, Sai Charan, Tondomker, Sai Harsh, Shukla, Kshitij, Kothapalli, Kishore
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc 01.08.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!