Sublinear Algorithms in T-Interval Dynamic Networks

We consider standard T - interval dynamic networks , under the synchronous timing model and the broadcast CONGEST model. In a T - interval dynamic network , the set of nodes is always fixed and there are no node failures. The edges in the network are always undirected, but the set of edges in the to...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 86; číslo 9; s. 2959 - 2996
Hlavní autoři:	Jahja, Irvan, Yu, Haifeng
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2024 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Distributed processing Graph theory Mathematics of Computing Network topologies Nodes Theory of Computation interval dynamic networks Distributed algorithms Sublinear algorithms
ISSN:	0178-4617, 1432-0541
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!