On the distributed complexity of computing maximal matchings

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 1, 2001, Pages 41-57

  Hańćkowiak, Michał ^a   Karoński, Michał ^a,b   Panconesi, Alessandro ^c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b EMORY UNIVERSITY   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Deterministic; Distributed; Graph algorithms; Synchronous

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE;

DETERMINISTICS; DISTRIBUTED COMPUTING; GRAPH ALGORITHMS; SYNCHRONOUS;

COMPUTATIONAL METHODS;

EID: 4243085252     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100373121     Document Type: Article

References (27)

1. B. AWERBUCH, A. V. GOLDBERG, M. LUBY, AND S. PLOTKIN, Network decomposition and locality in distributed computing, in Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 364-369.
2. B. AWERBUCH, B. BERGER, L. COWEN, AND D. PELEG, Fast network decompositions, in Proceedings of the ACM Symposium on Principles of Distributed Computing, 1992, pp 169-177.
3. N. ALON, J. SPENCER, AND P. ERDOS, The Probabilistic Method, John Wiley and Sons, New York, 1992.
4. B. BOLLOBÁS, Graph Theory, Springer-Verlag, New York, 1979.
5. B. BOLLOBÁS, Chromatic number, girth, and maximal degree, Discrete Math., 24 (1978), pp. 311-314.
6. R. COLE AND U. VISHKIN, Deterministic coin tossing with applications to optimal parallel list ranking, Inform, and Control, 70 (1986), pp. 32-53.
7. A. V. GOLDBERG, S. A. PLOTKIN, AND G. E. SHANNON, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math., 1 (1988), pp. 434-446.
8. D. A. GRABLE AND A. PANCONESI, Nearly optimal distributed edge colouring in O(log log n) rounds, Random Structures Algorithms, 10 (1997), pp. 385-405.
9. M. HAŃĆKOWIAK, M. KAROŃSKI, AND A. PANCONESI, On the distributed complexity of computing maximal matchings, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, pp. 219-225.
10. A. ISRAELI AND Y. SHILOACH, An improved algorithm for maximal matching, Inform. Process. Lett., 22 (1986), pp. 57-60.
11. Y. HAN, An improvement on parallel computation of a maximal matching. Inform. Process. Lett., 56 (1995), pp. 343-348.
12. H. J. KARLOFF AND D. B. SHMOYS, Efficient parallel algorithms for edge coloring problems, J. Algorithms, 8 (1987), pp. 39-52.
13. R. M KARP, Probabilistic recurrence relations, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 190-197.
14. S. KUTTEN AND D. PELEG, Fast distributed construction of k-dominating sets and applications, in Proceedings of the ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, 1995, pp. 238-249.
15. N. LYNCH, Distributed Algorithms, Morgan Kaufmann, San Francisco, 1996.
16. A. PANCONESI, Lecture Notes in Distributed Algorithms, http://www.nada.kth.se/kurser/kth/2D5340.
17. N. LINIAL, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), pp. 193-201.
18. N. LINIAL AND M. SAKS, Low diameter graph decomposition, Combinatorica, (1993), pp. 441-454.
19. M. LUBY, A simple parallel algorithm for the maximal independent set problem, in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, RI, 1985, pp. 1-10.
20. M LUBY, Removing randomness in parallel without processor penalty, J. Comput. System Sci., 47 (1993), pp. 250-286.
21. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
22. M. NAOR, A lower bound on probabilistic algorithms for distributive ring coloring, SIAM J. Discrete Math., 4 (1991), pp. 409-412.
23. M. NAOR AND L. STOCKMEYER, What can be computed locally?, SIAM J. Cornput., 24 (1995), pp. 1259-1277
24. Ö JOHANSSON, private communication.
25. A PANCONESI, Lecture Notes in (Theoretical) Distributed Computing, KTH NADA Tech. Report TRITA-NA-9801, KTH, Stockholm, Sweden, 1998.
26. A. PANCONESI AND A. SRINIVASAN, The local nature of Δ-coloring and its algorithmic applications, Combinatorica, 15 (1995), pp. 255-280.
27. A. PANCONESI AND A. SRINIVASAN, On the complexity of distributed network decomposition, J. Algorithms, 20 (1996), pp. 356-374.