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

Celý popis

Podrobná bibliografie

Vydáno v:	Concurrency and computation Ročník 35; číslo 17
Hlavní autoři:	Regunta, Sai Charan, Tondomker, Sai Harsh, Shukla, Kshitij, Kothapalli, Kishore
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc 01.08.2023
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!