Dynamic connectivity with expected polylogarithmic worst-case update time

DOI10.1137/1.9781611978971.220MaRDI QIDQ7294764zbMATH OpenFDO

Authors Simon Meierhans, Maximilian Probst Gutenberg

Publication date 13 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978971.220

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Dynamic connectivity with expected polylogarithmic worst-case update time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294764)