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. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Fontaine, A., Métivier, Y., Robson, J. M., & Zemmari, A. (2014). On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8327 LNCS, pp. 235–245). Springer Verlag. https://doi.org/10.1007/978-3-319-04298-5_21
Mendeley helps you to discover research relevant for your work.