@inproceedings{83c7cad48e894ca19b64d5b051c8994a,
title = "Faster worst case deterministic dynamic connectivity",
abstract = "We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(√n(log log n)2/log n) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O(√n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.",
keywords = "Dynamic graph, Spanning tree",
author = "Casper Kejlberg-Rasmussen and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup",
note = "Publisher Copyright: {\textcopyright} Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup.; 24th Annual European Symposium on Algorithms, ESA 2016 ; Conference date: 22-08-2016 Through 24-08-2016",
year = "2016",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.ESA.2016.53",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christos Zaroliagis and Piotr Sankowski",
booktitle = "24th Annual European Symposium on Algorithms, ESA 2016",
address = "ألمانيا",
}