Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fully Dynamic Maximal Independent Set with Sublinear Update Time   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(\min\{\Delta,m^{3/4}\})$,
where $\Delta$ 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(\min\{\Delta,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.

7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
34
The categories of this paper are: chem-ph
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
36
The categories of this paper are: cmp-lg
19
The categories of this paper are: eess
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
16
The categories of this paper are: stat
11
The categories of this paper are: hep-lat