Distributed algorithm for approximating the maximum matching

We present a distributed algorithm that finds a matching M of size which is at least 2/3 |M*| where M* is a maximum matching in a graph. The algorithm runs in O(log6 n) steps.

[1]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[2]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[3]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[4]  Andrew V. Goldberg,et al.  Approximating Matchings in Parallel , 1993, Inf. Process. Lett..