Distributed algorithm for approximating the maximum matching

https://doi.org/10.1016/j.dam.2003.10.004Get rights and content
Under an Elsevier user license
open archive

Abstract

We present a distributed algorithm that finds a matching M of size which is at least 23|M| where M is a maximum matching in a graph. The algorithm runs in O(log6n) steps.

Keywords

Distributed algorithm
Maximum matching

Cited by (0)

Research supported by KBN Grant No. 7 T11C 032 20.