On Lower Bounds for the Time and the Bit Complexity of some Probabilistic Distributed Graph Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

On Lower Bounds for the Time and the Bit Complexity of some Probabilistic Distributed Graph Algorithms

Abstract

This paper concerns probabilistic distributed graph algorithms to solve classical graph problems such as colouring, maximal matching or maximal independent set. We consider anonymous networks (no unique identifiers are available) where vertices communicate by single bit messages. We present a general framework, based on coverings, for proving lower bounds for the bit complexity and thus the execution time to solve these problems. In this way we obtain new proofs of some well known results and some new ones. The last part gives impossibility results on the existence of Las Vegas distributed algorithms to break symmetries at distance $k$ for $k\geq 3.$
No file

Dates and versions

hal-00873468 , version 1 (15-10-2013)

Identifiers

  • HAL Id : hal-00873468 , version 1

Cite

Allyx Fontaine, Yves Métivier, John Michael Robson, Akka Zemmari. On Lower Bounds for the Time and the Bit Complexity of some Probabilistic Distributed Graph Algorithms. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2014, Slovakia. pp.235-245. ⟨hal-00873468⟩

Collections

CNRS
228 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More