A New Self-Stabilizing Maximal Matching Algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2009

A New Self-Stabilizing Maximal Matching Algorithm

Fredrik Manne
  • Fonction : Auteur
Morten Mjelde
  • Fonction : Auteur
Laurence Pilard
Sébastien Tixeuil

Résumé

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given several self-stabilizing algorithms that solve the problem for both the adversarial and the 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 has the same time complexity as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best time complexities for the distributed adversarial daemon from O(n2)O(n2) and O(δm)O(δm) to O(m)O(m) where nn is the number of processes, mm is the number of edges, and δδ is the maximum degree in the graph.

Dates et versions

hal-01151767 , version 1 (13-05-2015)

Identifiants

Citer

Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil. A New Self-Stabilizing Maximal Matching Algorithm. Theoretical Computer Science, 2009, 410 (14), pp.1336-1345. ⟨10.1016/j.tcs.2008.12.022⟩. ⟨hal-01151767⟩
113 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More