Fully dynamic maximal independent set with polylogarithmic update time
S Behnezhad, M Derakhshan… - 2019 IEEE 60th …, 2019 - ieeexplore.ieee.org
We present the first algorithm for maintaining a maximal independent set (MIS) of a fully
dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time …
dynamic graph-which undergoes both edge insertions and deletions-in polylogarithmic time …
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg… - ar** is Efficient: MIS in O(1)-rounds Node-averaged Awake Complexity
Maximal Independent Set (MIS) is one of the fundamental problems in distributed
computing. The round (time) complexity of distributed MIS has traditionally focused on the …
computing. The round (time) complexity of distributed MIS has traditionally focused on the …