Title: Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time
Abstract: We present two algorithms for dynamically maintaining a spanning forest of a graph undergoing edge insertions and deletions. Our algorithms guarantee worst-case update time and work against an adaptive adversary, meaning that an edge update can depend on previous outputs of the algorithms. We provide the first polynomial improvement over the long-standing O(√n) bound of [Frederickson STOC'84, Eppstein, Galil, Italiano and Nissenzweig FOCS'92] for such type of algorithms. The previously best improvement was O(√n (loglogn)2/logn) [Kejlberg-Rasmussen, Kopelowitz, Pettie and Thorup ESA'16]. We note however that these bounds were obtained by deterministic algorithms while our algorithms are randomized.
Publication Year: 2017
Publication Date: 2017-06-19
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 67
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot