R. S. Jean, F. Blair, and . Manne, Efficient self-stabilizing algorithms for tree network, ICDCS, p.20, 2003.

A. Daliot and D. Dolev, Self-stabilization of Byzantine Protocols, Self-Stabilizing Systems, pp.48-67, 2005.
DOI : 10.1007/11577327_4

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

. Shlomi and . Dolev, Self-stabilization, 2000.

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of Byzantine faults, Journal of the ACM, vol.51, issue.5, pp.780-799, 2004.
DOI : 10.1145/1017460.1017463

S. Dubois, T. Masuzawa, and S. Tixeuil, The Impact of Topology on Byzantine Containment in Stabilization, Proceedings of DISC 2010, 2010.
DOI : 10.1007/978-3-642-15763-9_47
URL : https://hal.archives-ouvertes.fr/inria-00481836

S. Dubois, T. Masuzawa, and S. Tixeuil, On Byzantine Containment Properties of the min???+???1 Protocol, Proceedings of SSS 2010, 2010.
DOI : 10.1007/978-3-642-16023-3_10
URL : https://hal.archives-ouvertes.fr/hal-01290827

S. Ghosh, A. Gupta, M. Hakan, K. Sriram, and V. Pemmaraju, Selfstabilizing dynamic programming algorithms on trees, Proceedings of the Second Workshop on Self-Stabilizing Systems, pp.11-12, 1995.

W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and P. K. Srimani, Selfstabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, IPDPS, 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. T. Hedetniemi, and Z. Shi, An anonymous self-stabilizing algorithm for 1-maximal matching in trees, PDPTA, pp.797-803, 2006.

C. Su, S. Hsu, and . Huang, A self-stabilizing algorithm for maximal matching, Inf. Process. Lett, vol.43, issue.2, pp.77-81, 1992.

L. Lamport, R. E. Shostak, and M. C. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

F. Manne, M. Mjelde, L. Pilard, and S. Tixeuil, A new self-stabilizing maximal matching algorithm, Theoretical Computer Science, vol.410, issue.14, pp.1336-1345, 2009.
DOI : 10.1016/j.tcs.2008.12.022
URL : https://hal.archives-ouvertes.fr/inria-00127899

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

T. Masuzawa and S. Tixeuil, Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults, International Journal of Principles and Applications of Information Science and Technology (PAIST), vol.1, issue.1, pp.1-13, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01152556

M. Nesterenko and A. 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

C. Marshall, R. E. Pease, L. Shostak, and . Lamport, Reaching agreement in the presence of faults, J. ACM, vol.27, issue.2, pp.228-234, 1980.

G. Tel, Maximal matching stabilizes in quadratic time, Information Processing Letters, vol.49, issue.6, pp.271-272, 1994.
DOI : 10.1016/0020-0190(94)90098-1

S. Tixeuil, Algorithms and Theory of Computation Handbook, Second Edition, chapter Self-stabilizing Algorithms Chapman & Hall/CRC Applied Algorithms and Data Structures, pp.26-27, 2009.