Dynamic bridge-finding in Õ (log2 n) amortized time

Jacob Holm, Eva Rotenberg, Mikkel Thorup

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

32 Downloads (Pure)

Abstract

We present a deterministic fully-dynamic data structure for maintaining information about the bridges in a graph. We support updates in Õ((log n)2) amortized time, and can find a bridge in the component of any given vertex, or a bridge separating any two given vertices, in O(log n= log log n) worst case time. Our bounds match the current best for bounds for deterministic fully-dynamic connectivity up to log log n factors. The previous best dynamic bridge finding was an Õ((log n)3) amortized time algorithm by Thorup [STOC2000], which was a bittrick-based improvement on the O((log n)4) amortized time algorithm by Holm et al.[STOC98, JACM2001]. Our approach is based on a different and purely combinatorial improvement of the algorithm of Holm et al., which by itself gives a new combinatorial Õ((log n)3) amortized time algorithm. Combining it with Thorup's bittrick, we get down to the claimed Õ((log n)2) amortized time. Essentially the same new trick can be applied to the biconnectivity data structure from [STOC98, JACM2001], improving the amortized update time to Õ((log n)3). We also offer improvements in space. We describe a general trick which applies to both of our new algorithms, and to the old ones, to get down to linear space, where the previous best use O(m + n log n log log n). Our result yields an improved running time for deciding whether a unique perfect matching exists in a static graph.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
EditorsArtur Czumaj
Number of pages18
PublisherAssociation for Computing Machinery
Publication date1 Jan 2018
Pages35-52
ISBN (Electronic)9781611975031
DOIs
Publication statusPublished - 1 Jan 2018
Event29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States
Duration: 7 Jan 201810 Jan 2018

Conference

Conference29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
CountryUnited States
CityNew Orleans
Period07/01/201810/01/2018
SponsorAssociation for Computing Machinery, Society for Industrial and Applied Mathematics
SeriesProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Fingerprint

Dive into the research topics of 'Dynamic bridge-finding in Õ (log<sup>2</sup> n) amortized time'. Together they form a unique fingerprint.

Cite this