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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Distributed computing Jg. 34; H. 4; S. 283 - 299
Hauptverfasser:	Mashreghi, Ali, King, Valerie
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!