An optimal bit complexity randomized distributed MIS algorithm

We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O (log n ) with probability 1 − o ( n −1 ), and only needs messages containing 1 bit. Thus, its bit complexity par channel is O (log n ). We assume that the graph is anonymou...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Distributed computing Jg. 23; H. 5-6; S. 331 - 340
Hauptverfasser:	Métivier, Y., Robson, J. M., Saheb-Djahromi, N., Zemmari, A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer-Verlag 01.04.2011 Springer Nature B.V Springer Verlag
Schriftenreihe:	Lecture notes in computer science
Schlagworte:	Algorithms Channels Complexity Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Distributed, Parallel, and Cluster Computing Exchange Graphs Lectures Management information systems Messages Software Engineering/Programming and Operating Systems Theory of Computation Neighbour Degree Arbitrary Graph Distant Vertex Active Neighbour Asymptotic Independence bit complexity Distributed graph algorithm randomized algorithm maximal independent set
ISSN:	0178-2770, 1432-0452
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!