Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model

We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with o ( m ) bits of communication, in a sufficiently dense graph with n nodes and m edges. For decades, it was believed that Ω ( m ) bits of communication are required for any algorithm that cons...

Celý popis

Podrobná bibliografie

Vydáno v:	Distributed computing Ročník 34; číslo 4; s. 283 - 299
Hlavní autoři:	Mashreghi, Ali, King, Valerie
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021 Springer Nature B.V
Témata:	Algorithms Broadcasting Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Graph theory Messages Nodes Software Engineering/Programming and Operating Systems Theory of Computation Distributed computing Minimum spanning tree Broadcast tree
ISSN:	0178-2770, 1432-0452
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!