A fast distributed algorithm for approximating the maximum matching

Andrzej Czygrinow, Michał Hańćkowiak, Edyta Szymańska

Research output: Contribution to journalArticle

13 Scopus citations

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 languageEnglish (US)
Pages (from-to)252-263
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
StatePublished - Dec 1 2004

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this