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.
|Original language||English (US)|
|Number of pages||10|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - Jan 1 2003|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)