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(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].
| 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 - Dec 1 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)