Fully Dynamic Connectivity in O(Log n(log log n)2) Amortized Expected Time

Shang En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup

doi:10.46298/theoretics.23.6

Fully Dynamic Connectivity in O(Log n(log log n)²) Amortized Expected Time

Shang En Huang
, Dawei Huang
, Tsvi Kopelowitz
, Seth Pettie
, Mikkel Thorup

Department of Computer Science and Artificial Intelligence

University of Michigan, Ann Arbor
University of Copenhagen

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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(log log n)²) amortized expected update time and O (log n/log log log 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).

Original language	English
Article number	6
Journal	TheoretiCS
Volume	2
DOIs	https://doi.org/10.46298/theoretics.23.6
State	Published - 2023

Bibliographical note

Publisher Copyright:
© 2023, TheoretiCS Foundation. All rights reserved.

Keywords

Amortized analysis
Connectivity
Dynamic graph

Access to Document

10.46298/theoretics.23.6

Cite this

@article{cc29e07fd4774f03a94a89293509d372,

title = "Fully Dynamic Connectivity in O(Log n(log log n)2) Amortized Expected Time",

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(log log n)2) amortized expected update time and O (log n/log log log 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).",

keywords = "Amortized analysis, Connectivity, Dynamic graph",

author = "Huang, \{Shang En\} and Dawei Huang and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup",

year = "2023",

doi = "10.46298/theoretics.23.6",

language = "אנגלית",

volume = "2",

journal = "TheoretiCS",

issn = "2751-4838",

publisher = "TheoretiCS Foundation",

}

TY - JOUR

T1 - Fully Dynamic Connectivity in O(Log n(log log n)2) Amortized Expected Time

AU - Huang, Shang En

AU - Huang, Dawei

AU - Kopelowitz, Tsvi

AU - Pettie, Seth

AU - Thorup, Mikkel

PY - 2023

Y1 - 2023

N2 - 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(log log n)2) amortized expected update time and O (log n/log log log 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).

AB - 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(log log n)2) amortized expected update time and O (log n/log log log 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).

KW - Amortized analysis

KW - Connectivity

KW - Dynamic graph

UR - https://www.scopus.com/pages/publications/105031102256

U2 - 10.46298/theoretics.23.6

DO - 10.46298/theoretics.23.6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:105031102256

SN - 2751-4838

VL - 2

JO - TheoretiCS

JF - TheoretiCS

M1 - 6

ER -