Distributed computing with advice: Information sensitivity of graph coloring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 231-242

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b   Ilcinkas, David ^c   Pelc, Andrzej ^c  

^a CNRS   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING; COMPUTER GRAPHICS; INFORMATION SYSTEMS;

GRAPH COLORING; INFORMATION SENSITIVITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38149130511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_22     Document Type: Conference Paper

References (24)

1. Alón, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms 7(4), 567-583 (1986)
2. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network Decomposition and Locality in Distributed Computation. In: 30th Symp. on Foundations of Computer Science(FOCS), pp. 364-369 (1989)
3. Bellare, M., Goldreich, O., Sudan, M.: Free Bits, PCPs, and Nonapproximability - Towards Tight Results. SIAM Journal on Computing 27(3), 804-915 (1998)
4. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-Guided Graph Exploration by a Finite Automaton. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 335-346. Springer, Heidelberg (2005)
5. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling Schemes for Tree Representation. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 13-24. Springer, Heidelberg (2005)
6. Cole, R., Vishkin, U.: Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In: 18th ACM Symp. on Theory of Computing (STOC), pp. 206-219. ACM Press, New York (1986)
7. Feige, U., Kilian, J.: Zero Knowledge and the Chromatic Number. J. Comput. Syst. Sei. 57(2), 187-199 (1998)
8. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16, 121-163 (2003)
9. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication tasks. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 179-187. ACM Press, New York (2006)
10. Goldberg, A., Plotkin, S.: Efficient parallel algorithms for (Δ + 1)-coloring and maximal independent set problems. In: 19th ACM Symp. on Theory of Computing (STOC), pp. 315-324. ACM Press, New York (1987)
11. Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. In: 19th ACM Symp. on Theory of Computing (STOC), pp. 315-324. ACM Press, New York (1987)
12. Karp, R.: Reducibility Among Combinatorial Problems. Complexity of Computer Computations, 85-103 (1972)
13. Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in O(√log n) bit rounds. In: 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE Computer Society Press, Los Alamitos (2006)
14. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed Locally! In: 23th ACM Symp. on Principles of Distributed Computing (PODC), pp. 300-309. ACM Press, New York (2004)
15. Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: 25th ACM Symp. on Principles of Distributed Computing (PODC), pp. 7-15. ACM Press, New York (2006)
16. Linial, N.: Locality in distributed graph algorithms. SIAM J. on Computing 21(1), 193-201 (1992)
17. Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15(4), 1036-1053 (1986)
18. Lynch, N.: A hundred impossibility proofs for distributed computing. In: 8th ACM Symp. on Principles of Distributed Computing (PODC), pp. 1-28. ACM Press, New York (1989)
19. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 39-48. ACM Press, New York (2005)
20. Naor, M., Stockmeyer, L.: What can be computed locally? In: 25th ACM Symposium on Theory of Computing (STOC), pp. 184-193. ACM Press, New York (1993)
21. Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distributed Computing 14, 97-100 (2001)
22. Panconesi, A., Srinivasan, A.: Improved distributed algorithms for coloring and network decomposition problems. In: 24th ACM Symp. on Theory of Computing (STOC), pp. 581-592. ACM Press, New York (1992)
23. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms 20(2), 356-374 (1996)
24. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics (2000)