Article Dans Une Revue Information Processing Letters Année : 2025

Luby's MIS Algorithms Made Self-Stabilizing

Résumé

We reconsider two well-known distributed randomized algorithms computing a maximal independent set, proposed in the seminal work of Luby (1986). We enhance these algorithms such that they become self-stabilizing without sacrificing their run-time, i.e., both stabilize in O(log n) synchronous rounds w.h.p. on any n-node graph. The first algorithm gets along with three states, but needs to know an upper bound on the maximum degree. The second does not need any information about the graph, but uses a number of states that is linear in the node degree. Both algorithms use messages of logarithmic size.

Fichier principal
Vignette du fichier
ss_lubys.pdf (146.61 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05207077 , version 1 (12-08-2025)

Licence

Identifiants

Citer

George Giakkoupis, Volker Turau, Isabella Ziccardi. Luby's MIS Algorithms Made Self-Stabilizing. Information Processing Letters, 2025, 188, pp.106531. ⟨10.1016/j.ipl.2024.106531⟩. ⟨hal-05207077⟩
107 Consultations
845 Téléchargements

Altmetric

Partager

  • More