Fully Dynamic Maximal Independent Set with Sublinear Update Time

02/27/2018
by   Sepehr Assadi, et al.
0

A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply recomputing it from scratch in O(m) time after each update. But can it be maintained in time sublinear in m in fully dynamic graphs? We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time O({Δ,m^3/4}), where Δ is a fixed bound on the maximum degree in the graph and m is the (dynamically changing) number of edges. We further present a distributed implementation of our algorithm with O({Δ,m^3/4}) amortized message complexity, and O(1) amortized round complexity and adjustment complexity (the number of vertices that change their output after each update). This strengthens a similar result by Censor-Hillel, Haramaty, and Karnin (PODC'16) that required an assumption of a non-adaptive oblivious adversary.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2018

Improved Algorithms for Fully Dynamic Maximal Independent Set

Maintaining maximal independent set in dynamic graph is a fundamental op...
research
10/30/2020

Dynamic Distributed MIS with Improved Bounds

The problem of maintaining a maximal independent set (MIS) in a dynamic ...
research
08/30/2018

Fully Dynamic MIS in Uniformly Sparse Graphs

We consider the problem of maintaining a maximal independent set (MIS) i...
research
06/26/2018

Fully Dynamic Maximal Independent Set with Sublinear in n Update Time

The first fully dynamic algorithm for maintaining a maximal independent ...
research
07/13/2018

Maintaning maximal matching with lookahead

In this paper we study the problem of fully dynamic maximal matching wit...
research
07/26/2017

A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph

We consider the maintenance of maximal bicliques from a dynamic bipartit...
research
08/02/2023

Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

A fundamental question in computational geometry is for a dynamic collec...

Please sign up or login with your details

Forgot password? Click here to reset