Distributed deterministic edge coloring using bounded neighborhood independence

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 129-138

  Barenboim, Leonid ^a   Elkin, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

defective coloring; legal coloring; line graphs

Indexed keywords

DEFECTIVE-COLORING; DETERMINISTIC ALGORITHMS; EDGE-COLORING; EDGE-COLORING ALGORITHMS; EDGE-COLORING PROBLEM; FUNDAMENTAL PROBLEM; GENERAL GRAPH; HYPER GRAPH; INPUT GRAPHS; LEGAL-COLORING; LINE GRAPH; LINE-GRAPHS; MAXIMUM DEGREE; RANDOMIZED ALGORITHMS; RUNNING TIME; SPEED-UPS; TECHNICAL CONTRIBUTION; VERTEX-COLORING;

ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS; MESSAGE PASSING;

COLORING;

EID: 79959887485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993825     Document Type: Conference Paper

References (29)

1. B. Awerbuch, A. V. Goldberg, M. Luby, and S. Plotkin. Network decomposition and locality in distributed computation. In Proc. of the 30th Symposium on Foundations of Computer Science, pages 364-369, 1989.
2. J. Andrews, and M. Jacobson. On a generalization of a chromatic number. Congressus Numer, 47:33-48, 1985.
3. L. Barenboim, and M. Elkin. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pages 25-34, 2008.
4. L. Barenboim, and M. Elkin. Distributed (Δ + 1)-coloring in linear (in Δ) time. In Proc. of the 41th ACM Symp. on Theory of Computing, pages 111-120, 2009.
5. L. Barenboim, and M. Elkin. Deterministic distributed vertex coloring in polylogarithmic time. In Proc. of the 29th ACM Symp. on Principles of Distributed Computing, pages 410-419, 2010.
6. L. Barenboim, and M. Elkin. Distributed deterministic edge coloring using bounded neighborhood independence. http://arXiv.org/abs/1010.2454, 2010.
7. M. Chudnovsky, and P. Seymour. The structure of claw-free graphs. Surveys in Combinatorics 2005, London Math Soc. Lecture Note Series, 327:153-171, 2005.
8. L. Cowen, R. Cowen, and D. Woodall. Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valence. Journal of Grah Theory, 10:187-195, 1986.
9. L. Cowen, W. Goddard, and C. Jesurum. Coloring with defect. In Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms, New Orleans, Louisiana, USA, pages 548-557, January 1997.
10. A. Czygrinow, M. Hanckowiak, and M. Karonski. Distributed O(Δ log n)-edge-coloring algorithm. In Proc. of the 9th Annual European Symposium on Algorithms, pages 345-355, 2001.
11. D. Dubhashi, D. Grable, and A. Panconesi. Nearly-optimal, distributed edge-colouring via the nibble method. Theoretical Computer Science, 203:225-251, 1998. (Pubitemid 128457258)
12. D. Durand, R. Jain, and D. Tseytlin. Applying randomized edge coloring algorithms to distributed communication: an experimental study. In Proc. of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 264-274, 1995.
13. B. Gfeller, and E. Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Proc. of the 26th ACM Symp. on Principles of Distributed Computing, pages 53-60, 2007.
14. D. Grable, and A. Panconesi. Nearly optimal distributed edge coloring in O(log log n) rounds Random Structures and Algorithms, 10(3):385-405, 1998.
15. F. Harary, and K. Jones. Conditional colorability II: Bipartite variations. Congressus Numer, 50:205-218, 1985.
16. R. Jain, K. Somalwar, J. Werth, and J. C. Browne. Scheduling parallel I/O operations in multiple bus systems. ELSEVIER Journal of Parallel and Distributed Computing, 16(4):352-362, 1992.
17. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. InProc. of the 24rd ACM Symp. on Principles of Distributed Computing, pages 60-68, 2005.
18. K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer. Distributed coloring in Õ(√log n) bit rounds. In Proc. of the 20th International Parallel and Distributed Processing Symposium, 2006.
19. F. Kuhn. Weak graph colorings: distributed algorithms and applications. In proc. of the 21st ACM Symposium on Parallel Algorithms and Architectures, pages 138-144, 2009.
20. F. Kuhn, and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. of the 25th ACM Symp. on Principles of Distributed Computing, pages 7-15, 2006.
21. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
22. N. Linial and M. Saks. Low diameter graph decomposition. Combinatorica 13: 441-454, 1993.
23. A. Panconesi, and R. Rizzi. Some simple distributed algorithms for sparse networks. Distributed computing, 14(2):97-100, 2001. (Pubitemid 32780320)
24. A. Panconesi, and A. Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):581-U{combining double acute accent}592, 1995.
25. A. Panconesi, and A. Srinivasan. Distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. on Computing, 26(2):350-368, 1997. (Pubitemid 127652069)
26. M. Szegedy, and S. Vishwanathan. Locality based graph coloring. In Proc. 25th ACM Symposium on Theory of Computing, pages 201-207, 1993.
27. J. Schneider, and R. Wattenhofer. A log-star distributed Maximal Independent Set algorithm for Growth Bounded Graphs. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pages 35-44, 2008.
28. J. Schneider, and R. Wattenhofer. A new technique for distributed symmetry breaking. To appear in Proc. of the 29th ACM Symp. on Principles of Distributed Computing, 2010.
29. V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret Analiz, 3:25-30, 1964.