Distributed coloring in Õ(√log n) bit rounds

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Kothapalli, Kishore ^a   Scheideier, Christian ^b   Onus, Melih ^c   Schindelhauer, Christian ^d  

^a Johns Hopkins University   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c Arizona State University   (United States)

^d UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING;

COMMUNICATION ROUNDS; DISTRIBUTED COLORING; N-NODE CYCLE; RANDOMIZED ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33847157507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639281     Document Type: Conference Paper

References (25)

1. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Can we elect if we cannot compare? In ACM SPAA, pages 324-332, 2003.
2. M. Bender, M. Farach-Colton, S. He, B. Kuszmaul, and C. Leiserson. Adversarial contention resolution for simple channels. In ACM SPAA, pages 325-332, 2005.
3. M. Choy and A. K. Singh. Efficient fault tolerant algorithms for resource allocation in distributed systems. In ACM STOC, pages 169-177, 1992.
4. R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In ACM STOC, pages 206-219, 1986.
5. D. P. Dubhashi and A. Panconesi. Near-optimal distributed edge coloring. In ESA, pages 448-459, 1995.
6. U. Feige and J. Kilian. Zero-knowledge and chromatic number. In Proc. of the Annual Conference on Computational Complexity, 1996.
7. I. Finocchi, A. Panconesi, and R. Silvestri. Experimental analysis of simple, distributed vertex coloring algorithms. In ACM SODA, pages 606-615, 2002.
8. P. Flocchini, B. Mans, and N. Santoro. On the impact of sense of direction on message complexity. Information Processing Letters, 63(1):23-31, 1997.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
10. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry breaking in sparse graphs. In ACM STOC, pages 434-446, 1987.
11. D. A. Grable. A large deviation inequality for functions of independent, multi-way choices. Comb. Probab. Comput., 7(1), 1998.
12. D. A. Grable and A. Panconesi. Nearly optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms, 10(3):385-405, 1997.
13. O. Johansson. Simpled distributed Δ + 1 coloring of graphs. Information Processing Letters, 70:229-232, 1999.
14. M. Karchmer and J. Naor. A fast parallel algorithm to color a graph with A colors. J. Algorithms, 9:83-91, 1988.
15. R. Karp and A. Widgerson. A fast parallel algorithm for the maximal independent set problem. J. ACM, 32(4):762-773, 1985.
16. V. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan. End-to-end packet-scheduling in wireless ad-hoc networks. In ACM SODA, pages 1021-1030, 2004.
17. N. Linial. Locality in distributed graph algorithms. SIAM J. of Computing, 21:193-201, 1992.
18. M. Luby. A simple parallel algorithm for the maximal independent set problem. In ACM STOC, pages 1-10, 1985.
19. M. Luby. Removing randomness in parallel without processor penalty. Journal of Computer and System Sciences, 47(2):250-286, 1993.
20. G. De Marco and A. Pelc. Fast distributed graph coloring with O(Δ) colors. In ACM SODA, pages 630-635, 2001.
21. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
22. M. Onus, A. Richa, K. Kothapalli, and C. Scheideler. Constant density spanners for wireless ad-hoc networks. In ACM SPAA, 2005.
23. A. Panconesi and A. Srinivasan. Fast randomized algorithms for distributed edge coloring. In ACM PODC, pages 251-262, 1992.
24. A. Panconesi and A. Srinivasan. On the complexity of distributed network decomposition. J. Algorithms, 20(2):356-374, 1996.
25. G. Singh. Efficient leader election using sense of direction. Distributed Computing, 10(3):159-165, 1997.