A new technique for distributed symmetry breaking

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 257-266

  Schneider, Johannes ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Coloring; Local algorithms; Network decomposition; Parallel algorithms; Symmetry breaking

Indexed keywords

ARBITRARY CONSTANTS; CONSTANT TIME; DISTRIBUTED ALGORITHM; GENERAL GRAPH; GRAPH CLASS; LOCAL ALGORITHM; MAXIMAL INDEPENDENT SET; NETWORK DECOMPOSITION; NEW RESULTS; POLYLOGARITHMIC; RANDOMIZED ALGORITHMS; SYMMETRY-BREAKING;

ALGEBRA; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

COLORING;

EID: 77956238694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835760     Document Type: Conference Paper

References (22)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast distributed network decompositions and covers. J. Parallel Distrib. Comput., 39(2):105-114, 1996.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Symp. on Foundations of Computer Science (FOCS), 1989.
4. L. Barenboim and M. Elkin. Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition. In Symp. on Principles of distributed computing, 2008.
5. L. Barenboim and M. Elkin. Distributed (δ + 1)-coloring in linear (in δ) time. In Symp. on Theory of computing, 2009.
6. L. Barenboim and M. Elkin. Deterministic distributed vertex coloring in polylogarithmic time. In PODC, 2010.
7. R. Cole and U. Vishkin. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control, 70(1):32-54, 1986.
8. P. L. Erdös, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of two others. J. Comb. Theory, Ser. A, 33(2):158-166, 1982.
9. B. Gfeller and E. Vicari. A Randomized Distributed Algorithm for the Maximal Independent Set Problem in Growth-Bounded Graphs. In Sy. on Principles of Distributed Computing, 2007.
10. A. Goldberg, S. Plotkin, and G. Shannon. Parallel Symmetry-Breaking in Sparse Graphs. SIAM Journal on Discrete Mathematics (SIDMA), 1(4):434-446, 1988.
11. D. A. Grable and A. Panconesi. Nearly optimal distributed edge colouring in o(log log n) rounds. In SODA, 1997.
12. A. Israeli and A. Itai. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:77-80, 1986.
13. 1/2n) bit rounds. In International Parallel & Distributed Processing Symp. (IPDPS), 2006.
14. F. Kuhn. Weak Graph Coloring: Distributed Algorithms and Applications. In SPAA, 2009.
15. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Local Approximation Schemes for Ad Hoc and Sensor Networks. In DIALM-POMC, 2005.
16. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In PODC, 2005.
17. F. Kuhn and R. Wattenhofer. On the Complexity of Distributed Graph Coloring. In PODC, 2006.
18. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
19. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 1986.
20. A. Panconesi and A. Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In Symp. on Theory of computing (STOC), 1992.
21. J. Schneider and R. Wattenhofer. A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In Symp. on Principles of Distributed Computing(PODC), 2008.
22. G. De Marco and A. Pelc. Fast distributed graph coloring with O(△) colors. In SODA, 2001.