Lower bounds for maximal matchings and maximal independent sets

01/08/2019
by   Alkida Balliu, et al.
0

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in O(Δ + ^* n) communication rounds; here n is the number of nodes and Δ is the maximum degree. The lower bound by Linial (1992) shows that the dependency on n is optimal: these problems cannot be solved in o(^* 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(Δ + n / n) rounds. Our lower bound holds for deterministic and randomized distributed algorithms in the LOCAL model of distributed computing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2020

Distributed Lower Bounds for Ruling Sets

Given a graph G = (V,E), an (α, β)-ruling set is a subset S ⊆ V such tha...
research
11/03/2022

Distributed Maximal Matching and Maximal Independent Set on Hypergraphs

We investigate the distributed complexity of maximal matching and maxima...
research
06/27/2019

Improved Distributed Approximation to Maximum Independent Set

We present improved results for approximating Maximum Independent Set ()...
research
10/04/2018

Distributed Reconfiguration of Maximal Independent Sets

Consider the following problem: given a graph and two maximal independen...
research
04/18/2019

A Conditional Lower Bound on Graph Connectivity in MapReduce

MapReduce (and its open source implementation Hadoop) has become the de ...
research
09/06/2023

Maximal Cliques in Scale-Free Random Graphs

We investigate the number of maximal cliques, i.e., cliques that are not...
research
02/27/2019

An exponential lower bound for the degrees of invariants of cubic forms and tensor actions

Using the Grosshans Principle, we develop a method for proving lower bou...

Please sign up or login with your details

Forgot password? Click here to reset