Self-Stabilizing Maximal Matching and Anonymous Networks

Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2

We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial dist…