Fully Dynamic MIS in Uniformly Sparse Graphs

08/30/2018
by   Krzysztof Onak, et al.
0

We consider the problem of maintaining a maximal independent set (MIS) in a dynamic graph subject to edge insertions and deletions. Recently, Assadi, Onak, Schieber and Solomon (STOC 2018) showed that an MIS can be maintained in sublinear (in the dynamically changing number of edges) amortized update time. In this paper we significantly improve the update time for uniformly sparse graphs. Specifically, for graphs with arboricity α, the amortized update time of our algorithm is O(α^2 ·^2 n), where n is the number of vertices. For low arboricity graphs, which include, for example, minor-free graphs as well as some classes of `real world' graphs, our update time is polylogarithmic. Our update time improves the result of Assadi et al. for all graphs with arboricity bounded by m^3/8 - ϵ, for any constant ϵ > 0. This covers much of the range of possible values for arboricity, as the arboricity of a general graph cannot exceed m^1/2.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
02/27/2018

Fully Dynamic Maximal Independent Set with Sublinear Update Time

A maximal independent set (MIS) can be maintained in an evolving m-edge ...
research
02/26/2018

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach

In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a l...
research
04/29/2019

Improved Dynamic Graph Coloring

This paper studies the fundamental problem of graph coloring in fully dy...
research
03/26/2019

On the Theory of Dynamic Graph Regression Problem

Most of real-world graphs are dynamic, i.e., they change over time. How...
research
01/18/2021

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao

We give an algorithm for computing exact maximum flows on graphs with m ...
research
07/11/2023

Words fixing the kernel network and maximum independent sets in graphs

The simple greedy algorithm to find a maximal independent set of a graph...

Please sign up or login with your details

Forgot password? Click here to reset