Deterministic replacement path covering

DOI10.5555/3458064.3458108MaRDI QIDQ6147293FDOQ6147293

Authors C. S. Karthik, M. Parter

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2008.05421

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
• Efficient oracles and routing schemes for replacement paths
• Fault-tolerant spanners
• Replacement paths and distance sensitivity oracles via fast matrix multiplication

Cited in

(2)

• Near-optimal distributed computation of small vertex cuts
• Approximate distance sensitivity oracles in subquadratic space

This page was built for publication: Deterministic replacement path covering

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