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)

Volumn 2697, Issue , 2003, Pages 242-251

  Czygrinow, A ^a   Hanckowiak M ^b  

^a ARIZONA STATE UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES;

MAXIMUM MATCHINGS; ODD CYCLE;

APPROXIMATION ALGORITHMS;

EID: 33746089605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_26     Document Type: Article

References (4)

1. A. Czygrinow, M. Hańćkowiak, E. Szymańska, Distributed algorithm for approximating the maximum matching, submitted, 2002.
2. T. Fischer, A. V. Goldberg, D. J. Haglin, S. Plotkin, Approximating matchings in parallel, Information Processing Letters, 1993, 46, pp. 115-118.
3. M. Hańćkowiak, M. Karoński, A. Panconesi, A faster distributed algorithm for computing maximal matching deterministically, Proceedings of PODC 99, the Eighteen Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 219-228.
4. N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 1992, 21(1), pp. 193-201.