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

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 34; no. 4; pp. 283 - 299
Main Authors:	Mashreghi, Ali, King, Valerie
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2021 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!