Faster worst case deterministic dynamic connectivity
From MaRDI portal
Publication:4606324
DOI10.4230/LIPIcs.ESA.2016.53zbMath1397.68142arXiv1507.05944OpenAlexW2963504179MaRDI QIDQ4606324
Seth Pettie, Mikkel Thorup, Casper Kejlberg-Rasmussen, Tsvi Kopelowitz
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1507.05944
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40)
Related Items (5)
Optimal decremental connectivity in planar graphs ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Approximating dynamic weighted vertex cover with soft capacities ⋮ Fully Dynamic Connectivity Oracles under General Vertex Updates
This page was built for publication: Faster worst case deterministic dynamic connectivity
