
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
The first fully dynamic algorithm for maintaining a maximal independent ...
read it

Representations of Sparse Distributed Networks: A LocalitySensitive Approach
In 1999, Brodal and Fagerberg (BF) gave an algorithm for maintaining a l...
read it

Fully Dynamic Maximal Independent Set with Sublinear Update Time
A maximal independent set (MIS) can be maintained in an evolving medge ...
read it

On the Theory of Dynamic Graph Regression Problem
Most of realworld graphs are dynamic, i.e., they change over time. How...
read it

Improved Dynamic Graph Coloring
This paper studies the fundamental problem of graph coloring in fully dy...
read it

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than GoldbergRao
We give an algorithm for computing exact maximum flows on graphs with m ...
read it

Improved Algorithms for Fully Dynamic Maximal Independent Set
Maintaining maximal independent set in dynamic graph is a fundamental op...
read it
Fully Dynamic MIS in Uniformly Sparse Graphs
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, minorfree 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
Comments
There are no comments yet.