@inproceedings{6b9515d9db4f4fb28bf21f269ac2dbd8,
title = "Fully dynamic maximal independent set with sublinear update time",
abstract = "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{∆,m3/4}), where ∆ 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{∆,m3/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{\textquoteright}16) that required an assumption of a non-adaptive oblivious adversary.",
keywords = "Dynamic distributed algorithms, Dynamic graph algorithms, Maximal independent set",
author = "Sepehr Assadi and Baruch Schieber and Krzysztof Onak and Shay Solomon",
note = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.; 50th Annual ACM Symposium on Theory of Computing, STOC 2018 ; Conference date: 25-06-2018 Through 29-06-2018",
year = "2018",
month = jun,
day = "20",
doi = "10.1145/3188745.3188922",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "431--444",
editor = "Monika Henzinger and David Kempe and Ilias Diakonikolas",
booktitle = "STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing",
address = "الولايات المتّحدة",
}