Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 25-34

  Barenboim, Leonid ^a   Elkin, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Arboricity; Coloring; Forests decomposition; MIS

Indexed keywords

COLORING; DISTRIBUTED COMPUTER SYSTEMS; FORESTRY; GRAPHIC METHODS; MANAGEMENT INFORMATION SYSTEMS;

ARBORICITY; BOUNDED DEGREE; BOUNDED TREEWIDTH; GRAPH-THEORETIC; LOWER BOUNDS; MAXIMAL INDEPENDENT SET; PLANAR GRAPH; SPARSE GRAPHS;

GRAPH THEORY;

EID: 57549110840     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400757     Document Type: Conference Paper

References (24)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7(4):567-583, 1986.
2. S. R. Arikati. A. Maheshwari, and C. Zaroliagis. Efficient Computation of Implicit Representations of Sparse Graphs. Discrete Applied Mathematics, 78(1-3):1-16, 1997.
3. 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.
4. B. Bollobas. Extremal Graph Theory. Academic Press, 1978.
5. R. Cole, and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32-53, 1986.
6. N. Deo and B. Litow. A structural approach to graph compression. In Proc. of the MFCS Workshop on Communications, pages 91-100, 1998.
7. V. Dujmovic, and D. R. Wood. Graph Treewidth and Geometric Thickness Parameters. Discrete and Computational Geometry, 37(4):641-670, 2007.
8. P. Erdos, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
9. 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
10. A. Goldberg, and S. Plotkin. Efficient parallel algorithms for (Δ + 1)- coloring and maximal independent set problem. In Proc. 19th ACM Symposium, on Theory of Computing, pages 315-324, 1987.
11. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics, 1(4):434U-446, 1988.
12. K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer. Distributed coloring in O(√logn) bit rounds. In Proc. of the 20th International Parallel and Distributed Processing Symposium, 2006.
13. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In 19th International Symposium on Distributed, Computing, 2005.
14. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be ccomputed locally! In Proc. of the 23rd ACM Symp. on Principles of Distributed Computing, pages 300-309, 2004.
15. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. InProc. of the 24rd, ACM Symp. on Principles of Distributed Computing, 2005.
16. 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.
17. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193U-201, 1992.
18. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
19. C. Nash-Williams. Decompositions of finite graphs into forests. J. London Math, 39:12, 1964.
20. A. Panconesi, and A. Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):581-U592, 1995.
21. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
22. 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, 2008.
23. G. Singh. Efficient leader election using sense of direction. Distributed Computing, 10(3):159U-165, 1997.
24. M. Szegedy, and S. Vishwanathan. Locality based graph coloring. In Proc. 25th ACM Symposium on Theory of Computing, pages 201-207, 1993.