A Self Stabilizing Algorithm for Maximal Matching in Anonymous Networks

We propose a self-stabilizing algorithm for computing a maximal matching in an anony- mous network. The complexity is O(n2) moves with high probability, under the ad- versarial distributed daemon. Among all adversarial distributed daemons and with the anonymous assumption, our algorithm provides the