Decremental single-source reachability and strongly connected components in O(m n) total update time

DOI10.1109/FOCS.2016.42MaRDI QIDQ6946467zbMATH OpenFDO

Authors Nikos Parotsidis, Giuseppe F. Italiano, Thomas Dueholm Hansen, Jakub Łącki, Shiri Chechik

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.42

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Fully dynamic strongly connected components in planar digraphs
• Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights

This page was built for publication: Decremental single-source reachability and strongly connected components in \(\widetilde{O}(m \sqrt{n})\) total update time

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