Leonid Barenboim
Abstract
Symmetry-breaking problems are among the most well studied in the field of distributed computing and yet the most fundamental questions about their complexity remain open. In this article we work in the LOCAL model (where the input graph and underlying distributed network are identical) and study the randomized complexity of four fundamental symmetry-breaking problems on graphs: computing MISs (maximal independent sets), maximal matchings, vertex colorings, and ruling sets. A small sample of our results includes the following:
—An MIS algorithm running in O(log2Δ + 2o(√log log n)) time, where Δ is the maximum degree. This is the first MIS algorithm to improve on the 1986 algorithms of Luby and Alon, Babai, and Itai, when log n ≪ Δ ≪ 2√log n, and comes close to the Ω(log Δ / log log Δ lower bound of Kuhn, Moscibroda, and Wattenhofer.
—A maximal matching algorithm running in O(log Δ + log 4log n) time. This is the first significant improvement to the 1986 algorithm of Israeli and Itai. Moreover, its dependence on Δ is nearly optimal.
—A (Δ + 1)-coloring algorithm requiring O(log Δ + 2o(√log log n) time, improving on an O(log Δ + √log n)-time algorithm of Schneider and Wattenhofer.
—A method for reducing symmetry-breaking problems in low arboricity/degeneracy graphs to low-degree graphs. (Roughly speaking, the arboricity or degeneracy of a graph bounds the density of any subgraph.) Corollaries of this reduction include an O(√log n)-time maximal matching algorithm for graphs with arboricity up to 2√log n and an O(log 2/3n)-time MIS algorithm for graphs with arboricity up to 2(log n)1/3.
Each of our algorithms is based on a simple but powerful technique for reducing a randomized symmetry-breaking task to a corresponding deterministic one on a poly(log n)-size graph.
- N. Alon. 1991. A parallel algorithmic version of the local lemma. Rand. Struct. Algor. 2, 4 (1991), 367--378. Google Scholar
Digital Library
- N. Alon, L. Babai, and A. Itai. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algor. 7 (1986), 567--583. Google ScholarDigital Library
- A. Amir, O. Kapah, T. Kopelowitz, M. Naor, and E. Porat. 2014. The family holiday gathering problem or fair and periodic scheduling of independent sets. CoRR abs/1408.2279 (2014).Google Scholar
- B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. 1989. Network decomposition and locality in distributed computation. In Proceedings 30th IEEE Symposium on Foundations of Computer Science (FOCS). 364--369. Google ScholarDigital Library
- R. Bar-Yehuda, K. Censor-Hillel, and G. Schwartzman. 2016. A distributed (2 + ε)-approximation for vertex cover in O(log Δ/εlog log Δ) rounds. CoRR abs/1602.03713 (2016).Google Scholar
- L. Barenboim. 2015. Deterministic (Δ + 1)-coloring in sublinear (in Δ) time in static, dynamic and faulty networks. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). 345--354. DOI:http://dx.doi.org/10.1145/2767386.2767410 Google ScholarDigital Library
- L. Barenboim and M. Elkin. 2010. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22, 5--6 (2010), 363--379.Google ScholarDigital Library
- L. Barenboim and M. Elkin. 2011. Deterministic distributed vertex coloring in polylogarithmic time. J. ACM 58, 5 (2011), 23. Google ScholarDigital Library
- L. Barenboim and M. Elkin. 2013. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, San Francisco, CA. Google ScholarDigital Library
- L. Barenboim, M. Elkin, and F. Kuhn. 2014. Distributed (Δ + 1)-coloring in linear (in Δ) time. SIAM J. Comput. 43, 1 (2014), 72--95.Google ScholarDigital Library
- J. Beck. 1991. An algorithmic approach to the Lovász local lemma. I. Rand. Struct. Algor. 2, 4 (1991), 343--366. Google ScholarDigital Library
- T. Bisht, K. Kothapalli, and S. V. Pemmaraju. 2014. Brief announcement: Super-fast t-ruling sets. In Proceedings 33rd ACM Symposium on Principles of Distributed Computing (PODC). 379--381. Google ScholarDigital Library
- K.-M. Chung, S. Pettie, and H.-H. Su. 2014. Distributed algorithms for the Lovász local lemma and graph coloring. In Proceedings 33rd ACM Symposium on Principles of Distributed Computing (PODC). 134--143. Google ScholarDigital Library
- R. Cole and U. Vishkin. 1986. Deterministic coin tossing with applications to optimal parallel list ranking. Inform. Control 70, 1 (1986), 32--53. Google ScholarDigital Library
- D. P. Dubhashi and A. Panconesi. 2009. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge. Google ScholarDigital Library
- D. P. Dubhashi and D. Ranjan. 1998. Balls and bins: A study in negative dependence. J. Rand. Struct. Algs. 13, 2 (1998), 99--124. Google ScholarDigital Library
- M. Elkin, S. Pettie, and H. H. Su. 2015. (2Δ − 1)-edge coloring is much easier than maximal matching in the distributed setting. In Proceedings 26th ACM-SIAM Symposium on Discrete Algorithms (SODA). 355--370. Google ScholarDigital Library
- B. Gfeller and E. Vicari. 2007. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Proceedings 26th Annual ACM Symposium on Principles of Distributed Computing (PODC). 53--60. Google ScholarDigital Library
- M. Ghaffari. 2016. An improved distributed algorithm for maximal independent set. In Proceedings 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 270--277. DOI:http://dx.doi.org/10.1137/1.9781611974331.ch20 Google ScholarDigital Library
- M. Hańćkowiak, M. Karoński, and A. Panconesi. 2001. On the distributed complexity of computing maximal matchings. SIAM J. Discr. Math. 15, 1 (2001), 41--57 (electronic). Google ScholarDigital Library
- D. Harris, J. Schneider, and H.-H. Su. 2016. Distributed (Δ + 1)-coloring in sublogarithmic rounds. In Proceedings 48th ACM Symposium on Theory of Computing (STOC). Google ScholarDigital Library
- A. Israeli and A. Itai. 1986. A fast and simple randomized parallel algorithm for maximal matching. Info. Proc. Lett. 22, 2 (1986), 77--80. Google ScholarDigital Library
- Ö. Johansson. 1999. Simple distributed Δ + 1-coloring of graphs. Info. Proc. Lett. 70, 5 (1999), 229--232. Google ScholarDigital Library
- A. Korman, J.-S. Sereni, and L. Viennot. 2013. Toward more localized local algorithms: Removing assumptions concerning global knowledge. Distrib. Comput. 26, 5--6 (2013), 289--308.Google ScholarDigital Library
- K. Kothapalli and S. V. Pemmaraju. 2011. Distributed graph coloring in a few rounds. In Proceedings 30th Annual ACM Symposium on Principles of Distributed Computing (PODC). 31--40. Google ScholarDigital Library
- K. Kothapalli and S. V. Pemmaraju. 2012. Super-fast 3-ruling sets. In Proceedings IARCS Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). LIPIcs, Vol. 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 136--147.Google Scholar
- K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer. 2006. Distributed coloring in O˜(√log n) bit rounds. In Proceedings 20th International Parallel and Distributed Processing Symposium (IPDPS). Google ScholarDigital Library
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. 2004. What cannot be computed locally! In Proceedings 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC). 300--309. Google ScholarDigital Library
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. 2010. Local computation: Lower and upper bounds. CoRR abs/1011.5470 (2010).Google Scholar
- F. Kuhn and R. Wattenhofer. 2006. On the complexity of distributed graph coloring. In Proceedings 25th Annual ACM Symposium on Principles of Distributed Computing (PODC). 7--15. Google ScholarDigital Library
- C. Lenzen and R. Wattenhofer. 2011. MIS on trees. In Proceedings 30th Annual ACM Symposium on Principles of Distributed Computing (PODC). 41--48. Google ScholarDigital Library
- N. Linial. 1992. Locality in distributed graph algorithms. SIAM J. Comput. 21, 1 (1992), 193--201. Google ScholarDigital Library
- N. Linial and M. E. Saks. 1993. Low diameter graph decompositions. Combinatorica 13, 4 (1993), 441--454.Google ScholarCross Ref
- M. Luby. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 4 (1986), 1036--1053. Google ScholarDigital Library
- R. A. Moser and G. Tardos. 2010. A constructive proof of the general Lovász local lemma. J. ACM 57, 2 (2010). DOI:http://dx.doi.org/10.1145/1667053.1667060 Google ScholarDigital Library
- C. St. J. A. Nash-Williams. 1964. Decomposition of finite graphs into forests. J. London Math. Soc. 39 (1964), 12.Google Scholar
- A. Panconesi and R. Rizzi. 2001. Some simple distributed algorithms for sparse networks. Distrib. Comput. 14, 2 (2001), 97--100. Google ScholarDigital Library
- A. Panconesi and A. Srinivasan. 1996. On the complexity of distributed network decomposition. J. Algor. 20, 2 (1996), 356--374. Google ScholarDigital Library
- D. Peleg. 2000. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA. Google ScholarDigital Library
- S. Pettie and H.-H. Su. 2015. Distributed algorithms for coloring triangle-free graphs. Inform. Comput. 243 (2015), 263--280. Google ScholarDigital Library
- R. Rubinfeld, G. Tamir, S. Vardi, and N. Xie. 2011. Fast local computation algorithms. In Proceedings of the 1st Symposium on Innovations in Computer Science (ICS). 223--238. See also CoRR abs/1104.1377.Google Scholar
- J. Schneider, M. Elkin, and R. Wattenhofer. 2013. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theor. Comput. Sci. 509 (2013), 40--50. Google ScholarDigital Library
- J. Schneider and R. Wattenhofer. 2010a. A new technique for distributed symmetry breaking. In Proceedings 29th Annual ACM Symposium on Principles of Distributed Computing (PODC). 257--266. Google ScholarDigital Library
- J. Schneider and R. Wattenhofer. 2010b. An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22, 5--6 (2010), 349--361.Google ScholarDigital Library
- H.-H. Su. 2015. Algorithms for Fundamental Problems in Computer Networks. Ph.D. Dissertation. University of Michigan.Google Scholar
- M. Szegedy and S. Vishwanathan. 1993. Locality based graph coloring. In Proceedings 25th ACM Symposium on Theory of Computing (STOC). 201--207. Google ScholarDigital Library
Index Terms
- The Locality of Distributed Symmetry Breaking
Recommendations
A new technique for distributed symmetry breaking
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computingWe introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three randomized algorithms for distributed (vertex or edge) coloring improving on ...
The Locality of Distributed Symmetry Breaking
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceWe present new bounds on the locality of several classical symmetry breaking tasks in distributed networks. A sampling of the results include \begin{enumerate} \item A randomized algorithm for computing a maximal matching (MM) in $O(\log\Delta + (\log\...
An optimal distributed (Δ+1)-coloring algorithm?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingVertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log∗n + Detd(poly logn)) time, where Detd(n′) ...
Comments