An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees.
Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi · 2006
We present an anonymous self-stabilizing algorithm for finding a 1-maximal matching in trees, and rings of length not divisible by 3. We show that the algorithm converges in O(n 4) moves under an arbitrary central daemon.