Randomised distributed MIS and colouring algorithms for rings with oriented edges in [formula omitted] bit rounds

Y Métivier,J.M Robson,A Zemmari

doi:10.1016/j.ic.2016.09.006

Randomised distributed MIS and colouring algorithms for rings with oriented edges in [formula omitted] bit rounds

Y Métivier, J.M Robson + Show 1 more

Open Access

https://doi.org/10.1016/j.ic.2016.09.006

Copy DOI

Journal: Information and Control	Publication Date: Sep 21, 2016
License type: publisher-specific-oa

Affiliation: University of Bordeaux, Laboratoire Bordelais de Recherche en Informatique, Institut Polytechnique de Bordeaux, French National Centre for Scientific Research

#Time Complexity #High Probability + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We present and analyse Las Vegas distributed algorithms which compute a MIS or a colouring for anonymous rings with an arbitrary orientation of the edges; their bit complexity and time complexity are O(log⁡n) with high probability. These algorithms are optimal modulo a multiplicative constant.

Full Text