Distributed algorithm for approximating the maximum matching

Authors:
A. Czygrinow;M. Hańćkowiak;E. Szymańska
Affiliations:
Department of Mathematics and Statistics, Arizona State University, Tempe, AZ;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland;Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 3
Cited 6

Locality in distributed graph algorithms

SIAM Journal on Computing
Approximating matchings in parallel

Information Processing Letters
On the Distributed Complexity of Computing Maximal Matchings

SIAM Journal on Discrete Mathematics

Distributed algorithms for weighted problems in sparse graphs

Journal of Discrete Algorithms
A two-stage hardware scheduler combining greedy and optimal scheduling

Journal of Parallel and Distributed Computing
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
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
Why locally-fair maximal flows in client-server networks perform well

Journal of Combinatorial Optimization
Distributed approximation algorithms for planar graphs

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

Quantified Score

Hi-index	0.05

Visualization

Abstract

We present a distributed algorithm that finds a matching M of size which is at least 2/3 |M*| where M* is a maximum matching in a graph. The algorithm runs in O(log6 n) steps.