Pairwise reachability oracles and preservers under failures

DOI10.4230/LIPICS.ICALP.2022.35MaRDI QIDQ6560822zbMATH OpenFDO

Authors Diptarka Chakraborty, Kushagra Chatterjee, Keerti Choudhary

Publication date 24 June 2024

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

zbMATH Keywords

fault-tolerantgraph sparsificationlower boundsreachability oraclereachability preservers

Mathematics Subject Classification ID

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

Cited in

(3)

• New extremal bounds for reachability and strong-connectivity preservers under failures
• Faster algorithm for second (s,t)-mincut and breaking quadratic barrier for dual edge sensitivity for (s,t)-mincut
• Minimum+1 Steiner cut and dual edge sensitivity oracle: bridging gap between global and (s,t)-cut

This page was built for publication: Pairwise reachability oracles and preservers under failures

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