Randomised distributed {MIS} and colouring algorithms for rings with oriented edges in O({\(\surd\)}(log n)) bit rounds

Yves Métivier (1) , John Michael Robson (1) , Akka Zemmari (1)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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(\sqrt{\log n})$ with high probability. These algorithms are optimal modulo a multiplicative constant.

Mots clés: Randomised distributed algorithm; maximal independent set; colouring; bit complexit

Domaines: Informatique [cs]

Yves Métivier, John Michael Robson, Akka Zemmari. Randomised distributed {MIS} and colouring algorithms for rings with oriented edges in O({\(\surd\)}(log n)) bit rounds. Information and Computation, 2016, 251, pp.208-214. ⟨10.1016/j.ic.2016.09.006⟩. ⟨hal-01408994⟩