DeepAI AI Chat
Log In Sign Up

Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time

by   Shiri Chechik, et al.

In the fully dynamic maximal independent set (MIS) problem our goal is to maintain an MIS in a given graph G while edges are inserted and deleted from the graph. The first non-trivial algorithm for this problem was presented by Assadi, Onak, Schieber, and Solomon [STOC 2018] who obtained a deterministic fully dynamic MIS with O(m^3/4) update time. Later, this was independently improved by Du and Zhang and by Gupta and Khan [arXiv 2018] to Õ(m^2/3) update time. Du and Zhang [arXiv 2018] also presented a randomized algorithm against an oblivious adversary with Õ(√(m)) update time. The current state of art is by Assadi, Onak, Schieber, and Solomon [SODA 2019] who obtained randomized algorithms against oblivious adversary with Õ(√(n)) and Õ(m^1/3) update times. In this paper, we propose a dynamic randomized algorithm against oblivious adversary with expected worst-case update time of O(log^4n). As a direct corollary, one can apply the black-box reduction from a recent work by Bernstein, Forster, and Henzinger [SODA 2019] to achieve O(log^6n) worst-case update time with high probability. This is the first dynamic MIS algorithm with very fast update time of poly-log.


page 1

page 2

page 3

page 4


Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time

We present the first algorithm for maintaining a maximal independent set...

Fully-Dynamic Coresets

With input sizes becoming massive, coresets—small yet representative sum...

Bootstrapping Dynamic Distance Oracles

Designing approximate all-pairs distance oracles in the fully dynamic se...

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

Many dynamic graph algorithms have an amortized update time, rather than...

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary

Designing dynamic graph algorithms against an adaptive adversary is a ma...

Improved Dynamic Colouring of Sparse Graphs

Given a dynamic graph subject to edge insertions and deletions, we show ...

Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary

Designing dynamic algorithms against an adaptive adversary whose perform...