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á bibliografia

Vydané v:	Distributed computing Ročník 34; číslo 4; s. 283 - 299
Hlavní autori:	Mashreghi, Ali, King, Valerie
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!