# 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.$
Type de document :
Communication dans un congrès
V. Geffert, B. Preneel, B. Rovan, J. Stuller and A M. Tjoa. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2014, Slovakia. Springer, 8327, pp.235-245, 2014, Lecture Notes in Computer Science

https://hal.archives-ouvertes.fr/hal-00873468
Contributeur : Yves Métivier <>
Soumis le : mardi 15 octobre 2013 - 16:31:03
Dernière modification le : mercredi 4 décembre 2013 - 15:37:21

### Identifiants

• HAL Id : hal-00873468, version 1

### Citation

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. V. Geffert, B. Preneel, B. Rovan, J. Stuller and A M. Tjoa. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2014, Slovakia. Springer, 8327, pp.235-245, 2014, Lecture Notes in Computer Science. <hal-00873468>

### Métriques

Consultations de la notice