Distributed algorithm for better approximation of the maximum matching

Authors:
A. Czygrinow;M. Hanckowiak
Affiliations:
Department of Mathematics and Statistics, Arizona State University, Tempe, AZ;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznan, Poland
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 3
Cited 5

Locality in distributed graph algorithms

SIAM Journal on Computing
Approximating matchings in parallel

Information Processing Letters
A faster distributed algorithm for computing maximal matchings deterministically

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

A near-optimal real-time hardware scheduler for large cardinality crossbar switches

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Distributed algorithms for weighted problems in sparse graphs

Journal of Discrete Algorithms
Improved distributed approximate matching

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Distributed approximation algorithms for planar graphs

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

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.