### Abstract

We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log^{4} |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

Original language | English (US) |
---|---|

Pages (from-to) | 252-263 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Volume | 3221 |

State | Published - 2004 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Biochemistry, Genetics and Molecular Biology(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*,

*3221*, 252-263.

**A fast distributed algorithm for approximating the maximum matching.** / Czygrinow, Andrzej; Hańćkowiak, Michał; Szymańska, Edyta.

Research output: Contribution to journal › Article

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, vol. 3221, pp. 252-263.

}

TY - JOUR

T1 - A fast distributed algorithm for approximating the maximum matching

AU - Czygrinow, Andrzej

AU - Hańćkowiak, Michał

AU - Szymańska, Edyta

PY - 2004

Y1 - 2004

N2 - We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

AB - We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2/3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log4 |V(G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the running time of an algorithm proposed recently by the authors in [2].

UR - http://www.scopus.com/inward/record.url?scp=33746100365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746100365&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33746100365

VL - 3221

SP - 252

EP - 263

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -