A Shared-Memory Algorithm for Updating Tree-Based Properties of Large Dynamic Networks

This paper presents a network-based template for analyzing large-scale dynamic data. Specifically, we propose a novel shared-memory parallel algorithm for updating tree-based structures or properties, such as connected components (CC) and minimum spanning trees (MST), on dynamic networks. The underl...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on big data Ročník 8; číslo 2; s. 302 - 317
Hlavní autoři:	Srinivasan, Sriram, Pollard, Samuel D., Norris, Boyana, Das, Sajal K., Bhowmick, Sanjukta
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.04.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Big Data connected components Data structures Dynamic networks Graph theory Heuristic algorithms Image edge detection Maintenance engineering minimum spanning tree Networks Parallel algorithms Partitioning algorithms shared memory algorithms
ISSN:	2332-7790, 2372-2096
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!