eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-04-06
11:1
11:17
10.4230/LIPIcs.OPODIS.2016.11
article
Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3
Cohen, Johanne
Maâmra, Khaled
Manoussakis, George
Pilard, Laurence
We present the first polynomial self-stabilizing algorithm for finding a (2/3)-approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne et al. and has a sub-exponential time complexity under the distributed adversarial daemon. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but with a time complexity in O(n^3) moves. Moreover, our algorithm only needs one more boolean variable than the previous one, thus as in the Manne et al. algorithm, it only requires a constant amount of memory space (three identifiers and two booleans per node).
https://drops.dagstuhl.de/storage/00lipics/lipics-vol070-opodis2016/LIPIcs.OPODIS.2016.11/LIPIcs.OPODIS.2016.11.pdf
Self-Stabilization
Distributed Algorithm
Fault Tolerance
Matching