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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Czygrinow, A., & Hańćkowiak, M. (2003). Distributed algorithm for better approximation of the maximum matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2697, 242–251. https://doi.org/10.1007/3-540-45071-8_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free