2000 character limit reached
Improved Algorithms for Fully Dynamic Maximal Independent Set
Published 24 Apr 2018 in cs.DS | (1804.08908v1)
Abstract: Maintaining maximal independent set in dynamic graph is a fundamental open problem in graph theory and the first sublinear time deterministic algorithm was came up by Assadi, Onak, Schieber and Solomon(STOC'18), which achieves amortized update time. We have two main contributions in this paper. We present a new simple deterministic algorithm with amortized update time, which improves the previous best result. And we also present the first randomized algorithm with expected amortized time against an oblivious adversary.
Paper Prompts
Sign up for free to create and run prompts on this paper.