Fast distributed graph coloring with O(&Dgr;) colors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 630-635

  De Marco, Gianluca ^a   Pelc, Andrzej ^b  

^a UNIVERSITY OF SALERNO   (Italy)

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

Author keywords

Algorithms; Performance; Theory; Verification

Indexed keywords

EID: 65549138499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. B. Awerbuch, A. Goldberg, M. Luby and S. Plotkin, Network decomposition and locality in distributed computation, in Proc. 30th IEEE Symp. on Foundations of Computer Science (1989), 364-369.
2. Baruch Awerbuch, Oded Goldreich, Ronen Vainish, David Peleg, A trade-off between information and communication in broadcast protocols, Journal of the ACM (JACM), v.37 n.2, p.238-256, April 1990 [doi>10.1145/77600.77618]
3. Amotz Bar-Noy, Shlomo Kipnis, Designing broadcasting algorithms in the postal model for message-passing systems, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.13-22, June 29-July 01, 1992, San Diego, California, United States [doi〉10.1145/140901.140903]
4. R Cole, U Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.206-219, May 28-30, 1986, Berkeley, California, United States [doi〉10.1145/12130.12151]
5. D. Z. Du and F. H. Hwang, Combinatorial group testing and its applications, World Scientific, Singapore, 1993.
6. R.C. Entringer and P.J. Slater, Gossips and telegraphs, J. Franklin Institute 307 (1979), 353-360.
7. S. Even, B. Monien, On the number of rounds necessary to disseminate information, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.318-327, June 18-21, 1989, Santa Fe, New Mexico, United States [doi〉10.1145/72935.72969]
8. Pierre Fraigniaud, Emmanuel Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, v.53 n.1-3, p.79-133, Sept. 14, 1994
9. Lezek Gasieniec, Andrzej Pelc, Broadcasting with a bounded fraction of faulty nodes, Journal of Parallel and Distributed Computing, v.42 n.1, p.11-20, April 10, 1997 [doi〉10.1006/jpdc.1997.1303]
10. A.L. Goldberg and M. Jerrum, A sub-logarithmic communication algorithm for the completely connected optical communication parallel computer, Technical Report ECSLFCS-92-234, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh (1992).
11. A. Goldberg, S. Plotkin, G. Shannon, Parallel symmetry-breaking in sparse graphs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.315-324, January 1987, New York, New York, United States [doi〉10.1145/28395.28429]
12. David A. Grable, Alessandro Panconesi, Nearly optimal distributed edge coloring in O(log log n) rounds, Random Structures & Algorithms, v.10 n.3, p.385-405, May 1997 [doi〉10.1002/(SICI)1098-2418(199705)10:3〈385::AID- RSA6〉3.0.CO;2-S]
13. J. Hromkovic, R. Klasing, B. Monien, and R. Peine, Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping) reflect more realistically, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers (1995), 125-212.
14. János Komlós, Albert G. Greenberg, Correction to "An asymptotically nonadaptive algorithm for conflict resolution i, IEEE Transactions on Information Theory, v.31 n.6, p.841-841, Nov. 1985
15. David W. Krumme, Fast gossiping for the hypercube, SIAM Journal on Computing, v.21 n.2, p.365-380, April 1992 [doi〉10.1137/0221026]
16. David W. Krumme, George Cybenko, K. N. Venkataraman, Gossiping in minimal time, SIAM Journal on Computing, v.21 n.1, p.111-139, Feb. 1992 [doi〉10.1137/0221010]
17. Nathan Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, v.21 n.1, p.193-201, Feb. 1992 [doi〉10.1137/0221015]
18. M. Luby, Removing randomness in parallel computation without a processor penalty, in Proc. 29 th IEEE Symposium on Foundations of Computer Science (1988), 162-173.
19. A. Mayer, M. Naor and L. Stockmeyer, Local computations on static and dynamic graphs, in Proc. 3rd. Israel Symposium on Theory and Computing Systems (1995).
20. Alessandro Panconesi, Aravind Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.581-592, May 04-06, 1992, Victoria, British Columbia, Canada [doi〉10.1145/129712.129769]
21. Alessandro Panconesi, Aravind Srinivasan, On the complexity of distributed network decomposition, Journal of Algorithms, v.20 n.2, p.356-374, March 1996 [doi〉10.1006/jagm.1996.0017]
22. Márió Szegedy, Sundar Vishwanathan, Locality based graph coloring, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.201-207, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167156]
23. P.J. Slater, E. Cockayne and S.T. Hedetniemi, Information dissemination in trees, SIAM J. Comput. 10 (1981), 692-701.
24. V. G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3 (1964), 25-30.