Distributed Computing

, Volume 14, Issue 2, pp 97–100

Some simple distributed algorithms for sparse networks

  • Alessandro Panconesi
  • Romeo Rizzi
Orignial articles

DOI: 10.1007/PL00008932

Cite this article as:
Panconesi, A. & Rizzi, R. Distrib Comput (2001) 14: 97. doi:10.1007/PL00008932

Summary.

We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings with at most \(2\Delta-1\) colours, and maximal matchings can be computed within \({\cal O}(\log^* n + \Delta)\) deterministic rounds, where \(\Delta\) is the maximum degree of the network. We also show how to find maximal independent sets and \((\Delta+1)\)-vertex colourings within \({\cal O}(\log^* n + \Delta^2)\) deterministic rounds. All hidden constants are very small and the algorithms are very simple.

Key words: Distributed computing – Sparse networks – Maximal independent set – Maximal matching – Vertex colouring – Edge colouring

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Alessandro Panconesi
    • 1
  • Romeo Rizzi
    • 2
  1. 1.DSI, Universitá La Sapienza di Roma, Via Salaria 113, 00198 Roma, Italy IT
  2. 2.BRICS, University of Århus, 8000 Århus C, Denmark DK