Faster worst case deterministic dynamic connectivity

Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup

doi:10.4230/LIPIcs.ESA.2016.53

Faster worst case deterministic dynamic connectivity

Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup

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

17 Scopus citations

Abstract

We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(√n(log log n)²/log n) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O(√n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.

Original language	English
Title of host publication	24th Annual European Symposium on Algorithms, ESA 2016
Editors	Christos Zaroliagis, Piotr Sankowski
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770156
DOIs	https://doi.org/10.4230/LIPIcs.ESA.2016.53
State	Published - 1 Aug 2016
Externally published	Yes
Event	24th Annual European Symposium on Algorithms, ESA 2016 - Aarhus, Denmark Duration: 22 Aug 2016 → 24 Aug 2016

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	57
ISSN (Print)	1868-8969

Conference

Conference	24th Annual European Symposium on Algorithms, ESA 2016
Country/Territory	Denmark
City	Aarhus
Period	22/08/16 → 24/08/16

Bibliographical note

Publisher Copyright:
© Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup.

Funding

This work is supported in part by the Danish National Research Foundation grant DNRF84 through the Center for Massive Data Algorithmics (MADALGO), and by NSF grants CCF-1217338, CNS-1318294, and CCF-1514383. M. Thorup's research is partly supported by Advanced Grant DFF-0602-02499B from the Danish Council for Independent Research under the Sapere Aude research career programme.

Funders	Funder number
National Science Foundation	CCF-1217338, DFF-0602-02499B, CNS-1318294, CCF-1514383
Natur og Univers, Det Frie Forskningsråd
Danmarks Grundforskningsfond

Keywords

Dynamic graph
Spanning tree

Access to Document

10.4230/LIPIcs.ESA.2016.53

Cite this

Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S., & Thorup, M. (2016). Faster worst case deterministic dynamic connectivity. In C. Zaroliagis, & P. Sankowski (Eds.), 24th Annual European Symposium on Algorithms, ESA 2016 Article 53 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 57). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2016.53

Kejlberg-Rasmussen, Casper ; Kopelowitz, Tsvi ; Pettie, Seth et al. / Faster worst case deterministic dynamic connectivity. 24th Annual European Symposium on Algorithms, ESA 2016. editor / Christos Zaroliagis ; Piotr Sankowski. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{ab612eedbeec4a2fb010a636853983b8,

title = "Faster worst case deterministic dynamic connectivity",

abstract = "We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(√n(log log n)2/log n) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O(√n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.",

keywords = "Dynamic graph, Spanning tree",

author = "Casper Kejlberg-Rasmussen and Tsvi Kopelowitz and Seth Pettie and Mikkel Thorup",

note = "Publisher Copyright: {\textcopyright} Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, and Mikkel Thorup.; 24th Annual European Symposium on Algorithms, ESA 2016 ; Conference date: 22-08-2016 Through 24-08-2016",

year = "2016",

month = aug,

day = "1",

doi = "10.4230/LIPIcs.ESA.2016.53",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Christos Zaroliagis and Piotr Sankowski",

booktitle = "24th Annual European Symposium on Algorithms, ESA 2016",

address = "גרמניה",

}

Kejlberg-Rasmussen, C, Kopelowitz, T, Pettie, S & Thorup, M 2016, Faster worst case deterministic dynamic connectivity. in C Zaroliagis & P Sankowski (eds), 24th Annual European Symposium on Algorithms, ESA 2016., 53, Leibniz International Proceedings in Informatics, LIPIcs, vol. 57, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 22/08/16. https://doi.org/10.4230/LIPIcs.ESA.2016.53

Faster worst case deterministic dynamic connectivity. / Kejlberg-Rasmussen, Casper; Kopelowitz, Tsvi; Pettie, Seth et al.
24th Annual European Symposium on Algorithms, ESA 2016. ed. / Christos Zaroliagis; Piotr Sankowski. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. 53 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 57).

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

TY - GEN

T1 - Faster worst case deterministic dynamic connectivity

AU - Kejlberg-Rasmussen, Casper

AU - Kopelowitz, Tsvi

AU - Pettie, Seth

AU - Thorup, Mikkel

PY - 2016/8/1

Y1 - 2016/8/1

N2 - We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(√n(log log n)2/log n) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O(√n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.

AB - We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(√n(log log n)2/log n) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O(√n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees.

KW - Dynamic graph

KW - Spanning tree

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

U2 - 10.4230/LIPIcs.ESA.2016.53

DO - 10.4230/LIPIcs.ESA.2016.53

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

AN - SCOPUS:85012996199

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 24th Annual European Symposium on Algorithms, ESA 2016

A2 - Zaroliagis, Christos

A2 - Sankowski, Piotr

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 24th Annual European Symposium on Algorithms, ESA 2016

Y2 - 22 August 2016 through 24 August 2016

ER -

Kejlberg-Rasmussen C, Kopelowitz T, Pettie S, Thorup M. Faster worst case deterministic dynamic connectivity. In Zaroliagis C, Sankowski P, editors, 24th Annual European Symposium on Algorithms, ESA 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. 53. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ESA.2016.53

Faster worst case deterministic dynamic connectivity

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this