Lower Bounds for Maximal Matchings and Maximal Independent Sets

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O(Δ + log^* n) communication rounds; here n is the number of nodes and Δ is the maximum degree. The lower bound by Linial (1987, 1992) shows that the dependency on n is optimal: these problems cannot be solved in o(log^* n) rounds even if Δ = 2. However, the dependency on Δ is a long-standing open question, and there is currently an exponential gap between the upper and lower bounds. We prove that the upper bounds are tight. We show that maximal matchings and maximal independent sets cannot be found in o(Δ + log log n / log log log n) rounds with any randomized algorithm in the LOCAL model of distributed computing. As a corollary, it follows that there is no deterministic algorithm for maximal matchings or maximal independent sets that runs in o(Δ + log n / log log n) rounds; this is an improvement over prior lower bounds also as a function of n.

[1]  Jukka Suomela,et al.  Hardness of Minimal Symmetry Breaking in Distributed Computing , 2018, PODC.

[2]  Mika Göös,et al.  Linear-in-delta lower bounds in the LOCAL model , 2014, PODC '14.

[3]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[4]  Nico Eigenmann.  ( Δ + 1 )-COLORING IN LINEAR ( IN Δ ) TIME , 2009 .

[5]  Leonid Barenboim,et al.  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks , 2016, J. ACM.

[6]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[7]  Alessandro Panconesi,et al.  On the distributed complexity of computing maximal matchings , 1997, SODA '98.

[8]  Alessandro Panconesi,et al.  Some simple distributed algorithms for sparse networks , 2001, Distributed Computing.

[9]  Seth Pettie,et al.  The Complexity of Distributed Edge Coloring with Small Palettes , 2017, SODA.

[10]  Moni Naor,et al.  A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring , 1991, SIAM J. Discret. Math..

[11]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[12]  Leonid Barenboim,et al.  The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[13]  Tsvi Kopelowitz,et al.  An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model , 2019, SIAM J. Comput..

[14]  Manuela Fischer,et al.  Improved deterministic distributed matching via rounding , 2017, Distributed Computing.

[15]  Roger Wattenhofer,et al.  Local Computation , 2010, J. ACM.

[16]  Jukka Suomela,et al.  A lower bound for the distributed Lovász local lemma , 2015, STOC.

[17]  Mika Göös,et al.  Linear-in-$$\varDelta $$Δ lower bounds in the LOCAL model , 2015, Distributed Computing.

[18]  Jukka Suomela,et al.  Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks , 2010, SPAA '10.

[19]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[20]  Pierre Fraigniaud,et al.  Local Conflict Coloring , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[21]  Mika Göös,et al.  Linear-in-$Δ$ Lower Bounds in the LOCAL Model , 2013, ArXiv.

[22]  Nathan Linial,et al.  Distributive graph algorithms Global solutions from local data , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[23]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[24]  Aravind Srinivasan,et al.  On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.

[25]  Alfredo Navarra,et al.  On the complexity of distributed graph coloring with local minimality constraints , 2009, Networks.

[26]  Jukka Suomela,et al.  Distributed maximal matching: greedy is optimal , 2012, PODC '12.

[27]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[28]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[29]  Alfredo Navarra,et al.  On the complexity of distributed graph coloring with local minimality constraints , 2009 .

[30]  Mohsen Ghaffari,et al.  An Improved Distributed Algorithm for Maximal Independent Set , 2015, SODA.

[31]  Sebastian Brandt,et al.  An Automatic Speedup Theorem for Distributed Problems , 2019, PODC.