Lower Bounds for Maximal Matchings and Maximal Independent Sets
Authors:
- 1 November 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 481-497
Abstract
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.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) TimeSIAM Journal on Computing, 2014
- On the complexity of distributed graph coloring with local minimality constraintsNetworks, 2009
- Some simple distributed algorithms for sparse networksDistributed Computing, 2001
- On the Distributed Complexity of Computing Maximal MatchingsSIAM Journal on Discrete Mathematics, 2001
- On the Complexity of Distributed Network DecompositionJournal of Algorithms, 1996
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- A Lower Bound on Probabilistic Algorithms for Distributive Ring ColoringSIAM Journal on Discrete Mathematics, 1991
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- A fast and simple randomized parallel algorithm for maximal matchingInformation Processing Letters, 1986