Lower bounds for maximal matchings and maximal independent sets
Preprint
Abstract
There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ 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 $\Delta = 2$. However, the dependency on $\Delta$ 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(\Delta + \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(\Delta + \log n / \log \log n)$ rounds; this is an improvement over prior lower bounds also as a function of $n$.
Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model2016
- Local Conflict Coloring2016
- Linear-in- $\varDelta $ Δ lower bounds in the LOCAL modelDistributed Computing, 2015
- The Locality of Distributed Symmetry Breaking2012
- On the complexity of distributed graph coloring with local minimality constraintsNetworks, 2009
- Some simple distributed algorithms for sparse networksDistributed Computing, 2001
- On the Complexity of Distributed Network DecompositionJournal of Algorithms, 1996
- Distributive graph algorithms Global solutions from local data1987
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986