Title of article
Distributed algorithm for approximating the maximum matching Original Research Article
Author/Authors
A. Czygrinow، نويسنده , , M. Ha??kowiak، نويسنده , , E. Szyma?ska، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
10
From page
62
To page
71
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(log6 n) steps.
Keywords
Distributed algorithm , Maximum Matching
Journal title
Discrete Applied Mathematics
Serial Year
2004
Journal title
Discrete Applied Mathematics
Record number
885921
Link To Document