An Improved Distributed Algorithm for Maximal Independent Set

@inproceedings{Ghaffari2016AnID,
  title={An Improved Distributed Algorithm for Maximal Independent Set},
  author={Mohsen Ghaffari},
  booktitle={SODA},
  year={2016}
}
  • M. Ghaffari
  • Published in SODA 16 June 2015
  • Computer Science, Mathematics
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents a very simple randomized algorithm for this problem providing a near-optimal local complexity, which incidentally, when combined with some known techniques, also leads to a near-optimal global complexity. Classical MIS algorithms of Luby [STOC'85] and Alon, Babai and Itai [JALG'86] provide the global complexity guarantee that, with high probability1, all… 
Distributed Approximation of Maximum Independent Set and Maximum Matching
TLDR
These algorithms are the first to achieve the provably optimal round complexity with respect to dependency on Δ and are part of a broad family of local aggregation algorithms for which a mechanism that allows the simulation to run in the CONGEST model without an additional overhead is described.
Distributed MIS via All-to-All Communication
TLDR
An improved randomized distributed algorithm for congested clique model that improves quadratically on the O(log Δ) algorithm of [Ghaffari, SODA'16], and a certain local sparsification technique for MIS, which is of independent interest.
Tight Analysis of Parallel Randomized Greedy MIS
TLDR
A high probability upper bound of O(log n) on the round complexity of this algorithm in general graphs is proved, and it is shown that parallel randomized greedy MIS is as fast as the celebrated algorithm of Luby.
On the complexity of local distributed graph problems
TLDR
The result can be viewed as showing that the only obstacle to getting efficient determinstic algorithms in the LOCAL model is an efficient algorithm to approximately round fractional values into integer values.
Tight Analysis of Parallel Randomized Greedy MIS
TLDR
A high probability upper bound of O(log n) on the round complexity of this algorithm in general graphs is proved and it is shown that parallel randomized greedy MIS is as fast as the celebrated algorithm of Luby.
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
TLDR
This work proves lower bounds for a much more relaxed family of distributed symmetry breaking problems and provides a novel way to do simplifications for round elimination, which is expected to be of independent interest.
Distributed algorithms for the Lovász local lemma and graph coloring
TLDR
Two new distributed algorithms for the Lovasz Local Lemma (LLL) are provided that improve on both the efficiency and simplicity of the Moser-Tardos algorithm and prove that any distributed LLL algorithm requires Ω(log* n) rounds.
Optimal Distributed Covering Algorithms
TLDR
This paper presents a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank ƒ, and shows that integer covering-programs can be reduced to the Minimum Weight Set Cover problem in the distributed setting.
On Derandomizing Local Distributed Algorithms
TLDR
This paper combines the method of conditional expectation with network decompositions to obtain a generic and clean recipe for derandomizing LOCAL algorithms, which leads to significant improvements on a number of problems, in cases resolving known open problems.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Distributed algorithms for the Lovász local lemma and graph coloring
TLDR
Two new distributed algorithms for the Lovasz Local Lemma (LLL) are provided that improve on both the efficiency and simplicity of the Moser-Tardos algorithm and prove that any distributed LLL algorithm requires Ω(log* n) rounds.
An optimal bit complexity randomized distributed MIS algorithm
We present a randomized distributed maximal independent set (MIS) algorithm for arbitrary graphs of size n that halts in time O(log n) with probability 1 − o(n−1), and only needs messages containing
Distributed algorithms for the Lovász local lemma and graph coloring
TLDR
Two new distributed algorithms for the Lovász local lemma are provided that improve on both the efficiency and simplicity of the Moser–Tardos algorithm.
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
TLDR
This paper presents several new bounds on the time and message complexities of randomized Monte Carlo algorithms for Graph Connectivity and Minimum Spanning Tree in the Congested Clique, and shows that Ω(n2) messages are needed by any algorithm that solves GC, regardless of the number of rounds used.
The Locality of Distributed Symmetry Breaking
TLDR
New bounds on the locality of several classical symmetry breaking tasks in distributed networks are presented and a new technique for reducing symmetry breaking problems on low arboricity graphs to low degree graphs is introduced.
Local Computation Algorithms for Graphs of Non-Constant Degrees
TLDR
A randomized LCA for computing maximal independent sets whose time and space complexities are quasi-polynomial in d and polylogarithmic in n and a randomized L CA that provides a (1-ε)-approximation to maximum matching with high probability.
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1992
TLDR
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.
MIS on trees
TLDR
This paper presents a solution with randomized running time O(√log n log log n) on trees, improving roughly quadratically on the state-of-the-art bound, and does not rely on any bound on the number of independent neighbors.
Improved distributed algorithms for coloring and network decomposition problems
TLDR
It is shown that A-coloring G is reducible in 0(log3 n/log A) time to (A+ I)-vertex coloring G in a distributed model, which leads to fast distributed algorithms, and a linear–processor NC algorithm, for Acoloring.
...
1
2
3
4
...