Fully dynamic shortest paths and reachability in sparse digraphs

DOI10.4230/LIPICS.ICALP.2023.84MaRDI QIDQ6638087zbMATH OpenFDO

Authors Adam Karczmarz, Piotr Sankowski

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.84

zbMATH Keywords

dynamic reachabilitydynamic shortest pathsdynamic transitive closure

Mathematics Subject Classification ID

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

This page was built for publication: Fully dynamic shortest paths and reachability in sparse digraphs

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