2019 · 56 citations · 30 references
ComputingComputer ScienceMathematicsAlgorithmsDistributed SystemsTheory Of ComputationApproximation AlgorithmsCommunication ComplexityComputational ComplexityDistributed AlgorithmsDistributed ComputingMatching TheoryCommunication Complexity Lower BoundsCommunication Complexity Of Graph ProblemsCommunication Complexity Upper BoundsComputational Complexity Of Graph AlgorithmsLower BoundsMatching AlgorithmsMatching ProblemsUpper Bounds
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.
30
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Michael Luby · SIAM Journal on Computing · 1986 · 1.1K citations
Locality in Distributed Graph Algorithms
Nathan Linial · SIAM Journal on Computing · 1992 · 885 citations
A simple parallel algorithm for the maximal independent set problem
Michael Luby · 1985 · 343 citations · Full text
What cannot be computed locally!
Fabian Kühn, Thomas Moscibroda, Rogert Wattenhofer · 2004 · 279 citations · Full text