An Improved Distributed Algorithm for Maximal Independent Set

DOI10.1137/1.9781611974331.CH20MaRDI QIDQ4575597zbMATH OpenOpenAlexFDO

Authors Mohsen Ghaffari

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.05093

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Abstract: The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This paper presents an extremely simple randomized algorithm providing a near-optimal local complexity for this problem, which incidentally, when combined with some recent techniques, also leads to a near-optimal global complexity. Classical algorithms of Luby [STOC'85] and Alon, Babai and Itai [JALG'86] provide the global complexity guarantee that, with high probability, all nodes terminate after $O(logn)$ rounds. In contrast, our initial focus is on the local complexity, and our main contribution is to provide a very simple algorithm guaranteeing that each particular node $v$ terminates after $O(logmathsfdeg(v)+log1/epsilon)$ rounds, with probability at least $1-epsilon$. The guarantee holds even if the randomness outside $2$-hops neighborhood of $v$ is determined adversarially. This degree-dependency is optimal, due to a lower bound of Kuhn, Moscibroda, and Wattenhofer [PODC'04]. Interestingly, this local complexity smoothly transitions to a global complexity: by adding techniques of Barenboim, Elkin, Pettie, and Schneider [FOCS'12, arXiv: 1202.1983v3], we get a randomized MIS algorithm with a high probability global complexity of $O(logDelta)+2^{O(sqrtloglogn)}$, where $Delta$ denotes the maximum degree. This improves over the $O(lo{g}^{2}Delta)+2^{O(sqrtloglogn)}$ result of Barenboim et al., and gets close to the $Omega(minlogDelta,sqrtlogn)$ lower bound of Kuhn et al. Corollaries include improved algorithms for MIS in graphs of upper-bounded arboricity, or lower-bounded girth, for Ruling Sets, for MIS in the Local Computation Algorithms (LCA) model, and a faster distributed algorithm for the Lov'asz Local Lemma.

Recommendations

• Improved distributed approximations for maximum independent set
• Distributed approximation of maximum independent set and maximum matching
• A new distributed approximation algorithm for the maximum weight independent set problem
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
• Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set
• Distributed Reconfiguration of Maximal Independent Sets
• Distributed reconfiguration of maximal independent sets
• A New Parallel Algorithm for the Maximal Independent Set Problem
• Distributed Computing
• A Simple Parallel Algorithm for the Maximal Independent Set Problem

Cited in

(87)

• Computing large independent sets in a single round
• A new distributed approximation algorithm for the maximum weight independent set problem
• Improved distributed \(\Delta\)-coloring
• Distributed reconfiguration of maximal independent sets
• Graph reconstruction in the congested clique
• What can be sampled locally?
• Improved deterministic distributed matching via rounding
• Derandomizing local distributed algorithms under bandwidth restrictions
• Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
• Can we locally compute sparse connected subgraphs?
• Toward more localized local algorithms: removing assumptions concerning global knowledge
• New techniques and tighter bounds for local computation algorithms
• Sublogarithmic distributed \textsc{MIS} algorithm for sparse graphs using Nash-Williams decomposition
• A log-star distributed maximal independent set algorithm for growth-bounded graphs
• MIS on trees
• Toward more localized local algorithms, removing assumptions concerning global knowledge
• Super-fast 3-ruling sets
• Using read-k inequalities to analyze a distributed MIS algorithm
• The locality of distributed symmetry breaking
• An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
• Tight Fault Locality
• An exponential separation between randomized and deterministic complexity in the LOCAL model
• A time hierarchy theorem for the LOCAL model
• On the complexity of local distributed graph problems
• On the probe complexity of local computation algorithms
• \((\Delta+1)\) coloring in the congested clique model
• Distributed set cover approximation: primal-dual with optimal locality
• Derandomizing distributed algorithms with small messages: spanners and dominating set
• Congested clique algorithms for graph spanners
• When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
• Distributed Reconfiguration of Maximal Independent Sets
• Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
• Network Decomposition and Distributed Derandomization (Invited Paper)
• Distributed (+1)-coloring via ultrafast graph shattering
• Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
• Feedback from nature, an optimal distributed algorithm for \textsc{Maximal Independent Set} selection
• \textsc{Maximal Independent Sets} in radio networks
• Distributed Maximal Independent Set using Small Messages
• Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
• Efficient computation of balanced structures
• Optimal dynamic distributed MIS
• Brief announcement: Using read-k inequalities to analyze a distributed MIS algorithm
• Distributed MIS via all-to-all communication
• Distributed Computing
• A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
• Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets
• Distributed Lower Bounds for Ruling Sets
• A topological perspective on distributed network algorithms
• Distributed algorithms for the Lovász local lemma and graph coloring
• Node and edge averaged complexities of local graph problems
• Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
• Component stability in low-space massively parallel computation
• Exact distributed sampling
• Distributed coloring of hypergraphs
• Distributed MIS in O(log log n) Awake Complexity
• Distributed MIS with Low Energy and Time Complexities
• Distributed Symmetry Breaking on Power Graphs via Sparsification
• Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization
• Optimal Message-Passing with Noisy Beeps
• Derandomizing local distributed algorithms under bandwidth restrictions
• The complexity of symmetry breaking in massive graphs
• Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications
• Improved distributed approximations for maximum independent set
• An optimal bit complexity randomized distributed MIS algorithm
• Resource efficient stabilization for local tasks despite unknown capacity links
• Sample-and-gather: fast ruling set algorithms in the low-memory MPC model
• Self-stabilizing MIS computation in the beeping model
• Variable version Lovász local lemma: a tale of two boundaries
• Exponential speedup over locality in \textsf{MPC} with optimal memory
• The message complexity of distributed graph optimization
• Local distributed rounding: generalized to MIS, matching, set cover, and beyond
• Mobile agents on chordal graphs: maximum independent set and beyond
• Distributed symmetry breaking on power graphs via sparsification
• Optimal message-passing with noisy beeps
• Rounds vs. communication tradeoffs for maximal independent sets
• Sampling and output estimation in distributed algorithms and LCAs
• Brief announcement: Massively parallel ruling set made deterministic
• Brief announcement: Self-stabilizing MIS computation in the beeping model
• Distributed independent sets in interval and segment intersection graphs
• Parallel derandomization for coloring
• Distributed MIS in O( n) awake complexity
• Locally computing edge orientations
• Agnostic proper learning of monotone functions: beyond the black-box correction barrier
• Distributed edge coloring in time polylogarithmic in \({\Delta }\)
• A fast coloring oracle for average case hypergraphs
• Distributed independent sets in interval and segment intersection graphs
• Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition

This page was built for publication: An Improved Distributed Algorithm for Maximal Independent Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575597)