Sensitive distance and reachability oracles for large batch updates

DOI10.1109/FOCS.2019.00034MaRDI QIDQ6944203zbMATH OpenFDO

Authors Jan van Den Brand, Thatchaphol Saranurak

Publication date 12 August 2025

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

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(14)

• New extremal bounds for reachability and strong-connectivity preservers under failures
• Better decremental and fully dynamic sensitivity oracles for subgraph connectivity
• Decremental sensitivity oracles for covering and packing minors
• New extremal bounds for reachability and strong-connectivity preservers under failures
• Deterministic replacement path covering
• Restorable shortest path tiebreaking for edge-faulty graphs
• Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time
• Near optimal dual fault tolerant distance oracle
• Connectivity oracles for predictable vertex failures
• Fault-tolerant bounded flow preservers
• Fault-tolerant ST-diameter oracles
• Fault-tolerant labeling and compact routing schemes
• Near-optimal vertex fault-tolerant labels for Steiner connectivity
• An optimal 3-fault-tolerant connectivity oracle

This page was built for publication: Sensitive distance and reachability oracles for large batch updates

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