Distributed algorithm for better approximation of the maximum matching

Andrzej Czygrinow, M. Hańćkowiak

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

Let G be a graph on n vertices that does not have odd cycles of lengths 3, ..., 2k - 1. We present an efficient distributed algorithm that finds in O(logD n) steps (D = D(k)) matching M such that |M| ≥ (1 - α)|M*|, where M* is a maximum matching in G, α = 1/k+1.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Distributed algorithm for better approximation of the maximum matching'. Together they form a unique fingerprint.

Cite this