BibTeX
CSL-JSON
MLA
Harvard
Fully Dynamic Connectivity in O(log n(loglog n)^2) Amortized Expected Time
release_avm5glsex5hlbgzoigxhvrip5a
by
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
Released
as a article
.
2022
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 O(log n(loglog n)^2) amortized expected update time and
O(log n/logloglog n) worst case query time, which comes very close to the
cell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup
(2011).
In text/plain
format
Archived Files and Locations
application/pdf 901.3 kB
file_spgvb6ntgndafcyybkhdsha6kq
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1609.05867v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links