Awake Complexity of Distributed Minimum Spanning Tree

We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in \(\tilde{O}(D+\sqrt{n})\) rounds in the standard CONGEST model (where \(n\) is the network size and \(D\) is the network diameter) and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-12
Hauptverfasser:	Augustine, John, Moses, William K, Pandurangan, Gopal
Format:	Artikel
Sprache:	eng
Schlagworte:	Ad hoc networks Algorithms Complexity Computer networks Distributed processing Graph theory Lower bounds Nodes Wireless networks
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!