Toward more localized local algorithms: Removing assumptions concerning global knowledge

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 49-58

  Korman, Amos ^a   Sereni, Jean Sébastien ^a   Viennot, Laurent ^b  

^a CNRS   (France)

^b INRIA   (France)

Author keywords

coloring; distributed algorithm; global knowledge; maximal matching; mis; parameters

Indexed keywords

COLORING ALGORITHMS; COLORING PROBLEMS; DISTRIBUTED ALGORITHM; DISTRIBUTED TOOLS; FUNDAMENTAL PROBLEM; GENERAL METHOD; GLOBAL KNOWLEDGE; GLOBAL PARAMETERS; LOCAL ALGORITHM; MAXIMAL MATCHINGS; MAXIMUM DEGREE; PARAMETERS; PRUNING ALGORITHMS; RANDOMIZED ALGORITHMS; RUNNING TIME; STATE OF THE ART;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS;

PARAMETER ESTIMATION;

EID: 79959907289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993814     Document Type: Conference Paper

References (37)

1. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem., J. Algorithms, 7 (1986), pp. 567-583.
2. B. AWERBUCH, Complexity of network synchronization, J. ACM, 32 (1985), pp. 804-823.
3. B. AWERBUCH, M. LUBY, A. V. GOLDBERG, AND S. A. PLOTKIN, Network decomposition and locality in distributed computation, in FOCS, 1989, pp. 364-369.
4. L. BARENBOIM AND M. ELKIN, Distributed (Δ + 1)-coloring in linear (in Δ) time, in STOC, 2009, pp. 111-120.
5. -, Deterministic distributed vertex coloring in polylogarithmic time, in PODC, 2010, pp. 410-419.
6. -, Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition, Distrib. Comput., 22 (2010), pp. 363-379.
7. -, Distributed deterministic edge coloring using bounded neighborhood independence, in PODC, 2011. Available at http://arxiv.org/abs/1010.2454.
8. J. L. BENTLEY AND A. C.-C. YAO, An almost optimal algorithm for unbounded searching, Inf. Process. Lett., 5 (1976), pp. 82-87.
9. R. COHEN, P. FRAIGNIAUD, D. ILCINKAS, A. KORMAN, AND D. PELEG, Label-guided graph exploration by a finite automaton, ACM Trans. Algorithms, 4 (2008), pp. 42:1-42:18.
10. R. COLE AND U. VISHKIN, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms, in STOC, 1986, pp. 206-219.
11. B. DERBEL, C. GAVOILLE, D. PELEG, AND L. VIENNOT, On the locality of distributed sparse spanner construction, in PODC, 2008, pp. 273-282.
12. D. DERENIOWSKI AND A. PELC, Drawing maps with advice, in DISC, Springer-Verlag, 2010, pp. 328-342.
13. P. FRAIGNIAUD, C. GAVOILLE, D. ILCINKAS, AND A. PELC, Distributed computing with advice: information sensitivity of graph coloring, Distrib. Comput., 21 (2009), pp. 395-403.
14. P. FRAIGNIAUD, D. ILCINKAS, AND A. PELC, Communication algorithms with advice, J. Comput. Syst. Sci., 76 (2010), pp. 222-232.
15. P. FRAIGNIAUD, A. KORMAN, AND E. LEBHAR, Local mst computation with short advice, in SPAA, 2007, pp. 154-160.
16. P. FRAIGNIAUD, A. KORMAN, AND D. PELEG, Local distributed decision. Submitted for Publication.
17. A. V. Goldberg and S. A. Plotkin, Efficient parallel algorithms for (Δ + 1)-coloring and maximal independent set problem, in STOC, 1987, pp. 315-324.
18. 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.
19. M. HAŃĆKOWIAK, M. KAROŃSKI, AND A. PANCONESI, On the distributed complexity of computing maximal matchings, SIAM J. Discrete Math., 15 (2001/02), pp. 41-57.
20. A. KORMAN AND S. KUTTEN, Distributed verification of minimum spanning trees, Distrib. Comput., 20 (2007), pp. 253-266.
21. A. KORMAN, S. KUTTEN, AND D. PELEG, Proof labeling schemes, Distrib. Comput., 22 (2010), pp. 215-233.
22. F. KUHN, Weak graph colorings: distributed algorithms and applications, in SPAA, 2009, pp. 138-144.
23. F. KUHN, T. MOSCIBRODA, AND R. WATTENHOFER, What cannot be computed locally!, in PODC, 2004, pp. 300-309.
24. F. KUHN AND R. WATTENHOFER, On the complexity of distributed graph coloring, in PODC, 2006, pp. 7-15.
25. C. LENZEN, Y. OSWALD, AND R. WATTENHOFER, What can be approximated locally?: case study: dominating sets in planar graphs, in SPAA, 2008, pp. 46-54.
26. N. LINIAL, Distributive graph algorithms global solutions from local data, in FOCS, 1987, pp. 331-335.
27. -, Locality in distributed graph algorithms, SIAM J. Comput., 21 (1992), p. 193.
28. Z. LOTKER, B. PATT-SHAMIR, AND A. ROSÉN, Distributed approximate matching, SIAM J. Comput., 39 (2009), pp. 445-460.
29. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
30. K. NAKANO AND S. OLARIU, Uniform leader election protocols for radio networks, IEEE Trans. Parallel Distrib. Syst., 13 (2002), pp. 516-526.
31. M. NAOR AND L. STOCKMEYER, What can be computed locally?, SIAM J. Comput., 24 (1995), pp. 1259-1277.
32. A. PANCONESI AND R. RIZZI, Some simple distributed algorithms for sparse networks, Distrib. Comput., 14 (2001), pp. 97-100.
33. A. PANCONESI AND A. SRINIVASAN, On the complexity of distributed network decomposition, J. Algorithms, 20 (1996), pp. 356-374.
34. D. PELEG, Distributed computing. A locality-sensitive approach., SIAM Monographs on Discrete Mathematics and Applications, SIAM, 343 p. , 2000.
35. J. SCHNEIDER AND R. WATTENHOFER, A new technique for distributed symmetry breaking, in PODC, 2010, pp. 257-266.
36. -, An optimal maximal independent set algorithm for bounded-independence graphs, Distrib. Comput., 22 (2010), pp. 1-13.
37. M. SZEGEDY AND S. VISHWANATHAN, Locality based graph coloring, in STOC, 1993, pp. 201-207.