A fast distributed algorithm for approximating the maximum matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 252-263

  Czygrinow, Andrzej ^a   Hańćkowiak, Michał ^a,b   Szymańska, Edyta ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MESSAGE PASSING;

ASYMPTOTIC COMPLEXITY; DISTRIBUTED APPROXIMATION ALGORITHM; GRAPH G; MAXIMAL MATCHINGS; MAXIMUM MATCHINGS; MESSAGE PASSING MODELS; RUNNING TIME;

ALGORITHMS;

EID: 33746100365     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_24     Document Type: Article

References (7)

1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computing. Proc. of the 30th Symposium on Foundations of Computer Science (FOCS 1989) 364-369
2. Czygrinow, A., Hańćkowiak, M., Szymańska, E.: Distributed algorithm for approximating the maximum matching. Discrete Applied Math, published online (March 19, 2004)
3. Fischer, T., Goldberg, A.V., Haglin, D. J., Plotkin, S.: Approximating matchings in parallel. Information Processing Letters 46 (1993) 115-118
4. Hańćkowiak, M., Karoński, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math. Vol.15, No.1, (2001) 41-57
5. Lovász, L., Plummer, M.: Matching Theory. Elsevier, Amsterdam and New York (1986)
6. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1) (1992) 193-201
7. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. on Computing 15(4) (1986) 254-278.