A New Self-Stabilizing Maximal Matching Algorithm

Fredrik Manne 1 Morten Mjelde 1 Laurence Pilard 2 Sébastien Tixeuil 3, 4
4 GRAND-LARGE - Global parallel and distributed computing
LRI - Laboratoire de Recherche en Informatique, LIFL - Laboratoire d'Informatique Fondamentale de Lille, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the adversarial and fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it stabilizes in the same number of moves as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best moves complexities for the distributed adversarial daemon from O(n^2) and O(delta m) to O(m) where n is the number of processes, m is thenumber of edges, and delta is the maximum degree in the graph.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, February 6, 2007 - 10:28:57 AM
Last modification on : Monday, December 9, 2019 - 5:24:06 PM
Long-term archiving on: Tuesday, September 21, 2010 - 12:35:07 PM


Files produced by the author(s)


  • HAL Id : inria-00127899, version 2
  • ARXIV : cs/0701189



Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil. A New Self-Stabilizing Maximal Matching Algorithm. [Research Report] RR-6111, INRIA. 2007, pp.17. ⟨inria-00127899v2⟩



Record views


Files downloads