TY - JOUR
T1 - Distributed algorithm for better approximation of the maximum matching
AU - Czygrinow, Andrzej
AU - Hańćkowiak, M.
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33746089605&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746089605&partnerID=8YFLogxK
U2 - 10.1007/3-540-45071-8_26
DO - 10.1007/3-540-45071-8_26
M3 - Article
AN - SCOPUS:33746089605
SN - 0302-9743
VL - 2697
SP - 242
EP - 251
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -