Fully dynamic connectivity in O(log n(log log n)2) amortized expected time

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

doi:10.1137/1.9781611974782.32

Fully dynamic connectivity in O(log n(log log n)2) amortized expected time

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

University of Michigan, Ann Arbor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

33 Scopus citations

Abstract

Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n= log log log n) query time, which comes within an O((log log n)2) factor of a lower bound due to Patrascu and Demaine. The new structure is based on a dynamic connectivity algorithm proposed by Thorup in an extended abstract at STOC 2000, which left out some important details.

Original language	English
Title of host publication	28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
Editors	Philip N. Klein
Publisher	Association for Computing Machinery
Pages	510-520
Number of pages	11
ISBN (Electronic)	9781611974782
DOIs	https://doi.org/10.1137/1.9781611974782.32
State	Published - 2017
Externally published	Yes
Event	28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 - Barcelona, Spain Duration: 16 Jan 2017 → 19 Jan 2017

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	0

Conference

Conference	28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
Country/Territory	Spain
City	Barcelona
Period	16/01/17 → 19/01/17

Bibliographical note

Publisher Copyright:
Copyright © by SIAM.

Access to Document

10.1137/1.9781611974782.32

Cite this

Huang, S. E., Huang, D., Kopelowitz, T., & Pettie, S. (2017). Fully dynamic connectivity in O(log n(log log n)2) amortized expected time. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 510-520). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 0). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974782.32

@inproceedings{c9df5f7d613e44d5abffcbdf85ca7ac4,

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 new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n= log log log n) query time, which comes within an O((log log n)2) factor of a lower bound due to Patrascu and Demaine. The new structure is based on a dynamic connectivity algorithm proposed by Thorup in an extended abstract at STOC 2000, which left out some important details.",

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

note = "Publisher Copyright: Copyright {\textcopyright} by SIAM.; 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 ; Conference date: 16-01-2017 Through 19-01-2017",

year = "2017",

doi = "10.1137/1.9781611974782.32",

language = "אנגלית",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "510--520",

editor = "Klein, {Philip N.}",

booktitle = "28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017",

}

Huang, SE, Huang, D, Kopelowitz, T & Pettie, S 2017, Fully dynamic connectivity in O(log n(log log n)2) amortized expected time. in PN Klein (ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 0, Association for Computing Machinery, pp. 510-520, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, 16/01/17. https://doi.org/10.1137/1.9781611974782.32

Fully dynamic connectivity in O(log n(log log n)2) amortized expected time. / Huang, Shang En; Huang, Dawei; Kopelowitz, Tsvi et al.
28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. ed. / Philip N. Klein. Association for Computing Machinery, 2017. p. 510-520 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 0).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

PY - 2017

Y1 - 2017

N2 - Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n= log log log n) query time, which comes within an O((log log n)2) factor of a lower bound due to Patrascu and Demaine. The new structure is based on a dynamic connectivity algorithm proposed by Thorup in an extended abstract at STOC 2000, which left out some important details.

AB - Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n= log log log n) query time, which comes within an O((log log n)2) factor of a lower bound due to Patrascu and Demaine. The new structure is based on a dynamic connectivity algorithm proposed by Thorup in an extended abstract at STOC 2000, which left out some important details.

UR - http://www.scopus.com/inward/record.url?scp=85016207025&partnerID=8YFLogxK

U2 - 10.1137/1.9781611974782.32

DO - 10.1137/1.9781611974782.32

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85016207025

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 510

EP - 520

BT - 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017

A2 - Klein, Philip N.

PB - Association for Computing Machinery

T2 - 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017

Y2 - 16 January 2017 through 19 January 2017

ER -

Fully dynamic connectivity in O(log n(log log n)2) amortized expected time

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this