Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time

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 t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TheoretiCS Jg. 2
Hauptverfasser: Huang, Shang-En, Huang, Dawei, Kopelowitz, Tsvi, Pettie, Seth, Thorup, Mikkel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: TheoretiCS Foundation e.V 02.05.2023
Schlagworte:
computer science - data structures and algorithms
ISSN:2751-4838, 2751-4838
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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).
AbstractList 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).
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).
Author Kopelowitz, Tsvi
Thorup, Mikkel
Pettie, Seth
Huang, Shang-En
Huang, Dawei
Author_xml – sequence: 1
  givenname: Shang-En
  surname: Huang
  fullname: Huang, Shang-En
– sequence: 2
  givenname: Dawei
  surname: Huang
  fullname: Huang, Dawei
– sequence: 3
  givenname: Tsvi
  surname: Kopelowitz
  fullname: Kopelowitz, Tsvi
– sequence: 4
  givenname: Seth
  surname: Pettie
  fullname: Pettie, Seth
– sequence: 5
  givenname: Mikkel
  surname: Thorup
  fullname: Thorup, Mikkel
BookMark eNpNkD1PwzAQhi1UJErpzpihAx1S_BE7zliVFipV6lI2hOXY5-IqiaskIMKvJ2oRML2PTrpHd-81GlShAoRuCZ4lgmbyvn2DUEPrTTOjbCYu0JCmnMSJZHLwj6_QuGkOGGOaUZ4wPkTb1XtRdNFDV-nSm2gRqgpM6z9820W-iibbu5ci7KPqFGecvtLpJJqXoW79F9ho-XnsV3rY-RJu0KXTRQPjnxyh59Vyt3iKN9vH9WK-iQ1JMhHn2BmR0zQlwLRMjc44cElApwxyTlIqnbFCOy4Ag-XY0lwygSXuP-HCYTZC67PXBn1Qx9qXuu5U0F6dBqHeK93fZwpQvUKL3LpE5izJrZBOCqIZTQi1goLrXfjsMnVomhrcr49gdepX_fWrKFOCfQN5uXFR
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/theoretics.23.6
DatabaseName CrossRef
DOAJ : Directory of Open Access Journals [open access]
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2751-4838
ExternalDocumentID oai_doaj_org_article_6e0a6bdf48b34bd68f861a32412d62ef
10_46298_theoretics_23_6
GroupedDBID AAFWJ
AAYXX
ADQAK
AFPKN
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
M~E
ID FETCH-LOGICAL-c1496-b0fc6b2771e3a87ca95e581ea73eb51728fcd6af56e0ed50d2b83608075156f03
IEDL.DBID DOA
ISSN 2751-4838
IngestDate Tue Oct 14 19:03:13 EDT 2025
Sat Nov 29 01:37:36 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://arxiv.org/licenses/nonexclusive-distrib/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1496-b0fc6b2771e3a87ca95e581ea73eb51728fcd6af56e0ed50d2b83608075156f03
OpenAccessLink https://doaj.org/article/6e0a6bdf48b34bd68f861a32412d62ef
ParticipantIDs doaj_primary_oai_doaj_org_article_6e0a6bdf48b34bd68f861a32412d62ef
crossref_primary_10_46298_theoretics_23_6
PublicationCentury 2000
PublicationDate 2023-05-02
PublicationDateYYYYMMDD 2023-05-02
PublicationDate_xml – month: 05
  year: 2023
  text: 2023-05-02
  day: 02
PublicationDecade 2020
PublicationTitle TheoretiCS
PublicationYear 2023
Publisher TheoretiCS Foundation e.V
Publisher_xml – name: TheoretiCS Foundation e.V
SSID ssj0002925435
Score 2.2175934
Snippet Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure...
Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a randomized Las Vegas dynamic connectivity data structure...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - data structures and algorithms
Title Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
URI https://doaj.org/article/6e0a6bdf48b34bd68f861a32412d62ef
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2751-4838
  dateEnd: 20241231
  omitProxy: false
  ssIdentifier: ssj0002925435
  issn: 2751-4838
  databaseCode: DOA
  dateStart: 20220101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2751-4838
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002925435
  issn: 2751-4838
  databaseCode: M~E
  dateStart: 20220101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV27TsMwFLVQxcCCQIAoL3noQIe0iV-xxwKtGKBlANQBEfkpdSCgtiDBwLfjRyllYmFJorwUnRvZ58r3ngNAi3vKgZTkGUPEZERTnQltcVYwmxNiDaex6_3-qhwO-XgsblasvkJNWJIHTsB1_TOSKeMIV5gow7jjrJCeBhTIMGRdGH0961lJpsIYjERo8qZpXZIwJHh32Rg46yDcYb_moRW5_jivDLbA5oIQwl76kG2wZusdMAqZ4Tu8SHbxMFaj6OTzACc1bI1OH_yYBeu4S4ftR9Ruwd6Tp9OTD2tg0DDWnk7C0OSxC-4G_dvzy2xhfZBpn7KwTOVOM4XKsrBY8lJLQS3lhZUltooGTymnDZOOenisoblBKnRjBGVhn5C5HO-BRv1c230ARa7DFcs8fMQ5JLSmEhsrfebBtMBN0P4GonpJCheVzwwiaNUPaBXCFWuCs4DU8r6gTR1P-IhVi4hVf0Xs4D9ecgg2gvF7LD1ER6Axn77aY7Cu3-aT2fQk_gx-e_3Z_wIJmrvj
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fully+Dynamic+Connectivity+in+%24O%28%5Clog+n%28%5Clog%5Clog+n%29%5E2%29%24+Amortized+Expected+Time&rft.jtitle=TheoretiCS&rft.au=Huang%2C+Shang-En&rft.au=Huang%2C+Dawei&rft.au=Kopelowitz%2C+Tsvi&rft.au=Pettie%2C+Seth&rft.date=2023-05-02&rft.issn=2751-4838&rft.eissn=2751-4838&rft.volume=2&rft_id=info:doi/10.46298%2Ftheoretics.23.6&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_theoretics_23_6
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2751-4838&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2751-4838&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2751-4838&client=summon