Optimal decremental connectivity in non-sparse graphs

DOI10.4230/LIPICS.ICALP.2023.6MaRDI QIDQ6637992zbMATH OpenFDO

Authors Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup

Publication date 14 November 2024

zbMATH Keywords

dynamic connectivitydecremental connectivity

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Optimal decremental connectivity in non-sparse graphs

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