We present an anonymous, constant-space, self-stabilizing algorithm for finding a 1-maximal independent set in tree graphs (and some rings). We show that the algorithm converges in O(n2) moves under any central daemon (one that at each time-step selects one of the privileged nodes to move).

---