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

(Extended Abstract)
  • Allyx Fontaine
  • Yves Métivier
  • John Michael Robson
  • Akka Zemmari
Conference paper

DOI: 10.1007/978-3-319-04298-5_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8327)
Cite this paper as:
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. In: Geffert V., Preneel B., Rovan B., Štuller J., Tjoa A.M. (eds) SOFSEM 2014: Theory and Practice of Computer Science. SOFSEM 2014. Lecture Notes in Computer Science, vol 8327. Springer, Cham

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Allyx Fontaine
    • 1
  • Yves Métivier
    • 1
  • John Michael Robson
    • 1
  • Akka Zemmari
    • 1
  1. 1.LaBRI UMR CNRS 5800Université de BordeauxTalenceFrance

Personalised recommendations