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

Full description

Saved in:

Bibliographic Details
Published in:	Distributed computing Vol. 23; no. 5-6; pp. 331 - 340
Main Authors:	Métivier, Y., Robson, J. M., Saheb-Djahromi, N., Zemmari, A.
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer-Verlag 01.04.2011 Springer Nature B.V Springer Verlag
Series:	Lecture notes in computer science
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!