J. Blair, F. Mannedij74-]-e, S. Dijkstra, S. Dubois, N. Tixeuil et al., Efficient self-stabilizing algorithms for tree network Self-stabilizing systems in spite of distributed control The byzantine brides problem, ICDCS, pp.20-643, 1974.

]. S. Ggh-+-95, A. Ghosh, M. Gupta, K. Hakan, V. Sriram et al., Self-stabilizing dynamic programming algorithms on trees, WSS, pp.11-12, 1995.

S. [. Goddard, D. Hedetniemi, P. Jacobs, and . Srimani, Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, Proceedings International Parallel and Distributed Processing Symposium, p.162, 2003.
DOI : 10.1109/IPDPS.2003.1213302
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9641

W. Goddard, S. Hedetniemi, and Z. Shi, An anonymous self-stabilizing algorithm for 1-maximal matching in trees, PDPTA, pp.797-803, 2006.

[. Hsu and S. Huang, A self-stabilizing algorithm for maximal matching, Information Processing Letters, vol.43, issue.2, pp.77-81, 1992.
DOI : 10.1016/0020-0190(92)90015-N

M. [. Manne, L. Mjelde, S. Pilard, and . Tixeuil, A new self-stabilizing maximal matching algorithm, TCS, issue.14, pp.4101336-1345, 2009.
DOI : 10.1016/j.tcs.2008.12.022
URL : https://hal.archives-ouvertes.fr/inria-00127899

M. [. Manne, L. Mjelde, S. Pilard, and . Tixeuil, A Self-stabilizing $\frac{2}{3}$ -Approximation Algorithm for the Maximum Matching Problem, TCS, vol.49, issue.6, pp.4125515-5526, 2011.
DOI : 10.1016/0020-0190(94)90098-1

A. [. Nesterenko and . Arora, Tolerance to unbounded Byzantine faults, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.22-29, 2002.
DOI : 10.1109/RELDIS.2002.1180170