Faster Worst Case Deterministic Dynamic Connectivity
Data Structures and Algorithms
2015-11-05 v2
Abstract
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (STOC 1983) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM 1997), which had update time . All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.
Cite
@article{arxiv.1507.05944,
title = {Faster Worst Case Deterministic Dynamic Connectivity},
author = {Casper Kejlberg-Rasmussen and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup},
journal= {arXiv preprint arXiv:1507.05944},
year = {2015}
}