Expander pruning with polylogarithmic worst-case recourse and update time

DOI10.1137/1.9781611978971.103MaRDI QIDQ7294623zbMATH OpenFDO

Authors Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak

Publication date 13 July 2026

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Expander pruning with polylogarithmic worst-case recourse and update time

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