Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
Data Structures and Algorithms
2024-02-14 v4
Abstract
Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure with amortized expected update time and worst case query time, which comes very close to the cell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup (2011).
Keywords
Cite
@article{arxiv.1609.05867,
title = {Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time},
author = {Shang-En Huang and Dawei Huang and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup},
journal= {arXiv preprint arXiv:1609.05867},
year = {2024}
}