Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:drops-oai.dagstuhl.de:6395

Faster Worst Case Deterministic Dynamic Connectivity

Authors
Publication date
1 January 2016
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 24th Annual European Symposium on Algorithms (ESA 2016)
Doi

    Abstract

    We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O(sqrt{(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(sqrt{n}). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees

    Similar works

    Full text

    thumbnail-image

    Dagstuhl Research Online Publication Server

    redirect
    oaioai:drops-oai.dagstuhl.de:6395
    Last time updated on 17/11/2016

    This paper was published in Dagstuhl Research Online Publication Server.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.